Encoder, decoder, encoding method, and decoding method

ABSTRACT

An encoder includes circuitry and memory coupled to the circuitry. In operation, the circuitry: performs quantization on a plurality of transform coefficients of a current block to be encoded, using a quantization matrix when orthogonal transform is performed on the current block and secondary transform is not performed on the current block; and performs quantization on the plurality of transform coefficients of the current block without using the quantization matrix when orthogonal transform is not performed on the current block and when both orthogonal transform and secondary transform are performed on the current block.

CROSS REFERENCE TO RELATED APPLICATIONS

This application is a U.S. continuation application of PCT International Patent Application Number PCT/JP2020/008531 filed on Feb. 28, 2020, claiming the benefit of priority of U.S. Provisional Patent Application No. 62/812,501 filed on Mar. 1, 2019, and the benefit of priority of U.S. Provisional Patent Application No. 62/819,914 filed on Mar. 18, 2019, the entire contents of which are hereby incorporated by reference.

BACKGROUND 1. Technical Field

The present disclosure relates to video coding, and relates to, for example, a system, a constituent element, a method, etc., in encoding and decoding of videos.

2. Description of the Related Art

The video coding technology has been developed from 11.261 And MPEG-1 to H.264/AVC (Advanced Video Coding), MPEG-LA, H.265 (ISO/IEC 23008-2 GEVC)/HEVC (High Efficiency Video Coding), and H.266/VVC (Versatile Video Codec). With this development, it is always required to improve and optimize video coding technology in order to process digital video data the amount of which has kept increasing in various kinds of applications.

It is to be noted that H.265/HEVC relates to one example of a conventional standard related to the above-described video coding technology.

SUMMARY

For example, an encoder according to an aspect of the present disclosure includes circuitry and memory coupled to the circuitry. In operation, the circuitry: performs quantization on a plurality of transform coefficients of a current block to be encoded, using a quantization matrix when orthogonal transform is performed on the current block and secondary transform is not performed on the current block; and performs quantization on the plurality of transform coefficients of the current block without using the quantization matrix when orthogonal transform is not performed on the current block and when both orthogonal transform and secondary transform are performed on the current block.

Some of implementations of embodiments according to the present disclosure may: improve a coding efficiency; simplify encoding/decoding; increase an encoding/decoding speed; and efficiently select appropriate constituent elements and/or operations to be used in encoding and decoding, such as appropriate filters, block sizes, motion vectors, reference pictures, reference blocks, etc.

Further advantages and effects according to one aspect of the present disclosure will become apparent from the Specification and the Drawings. These advantages and/or effects are obtainable by some embodiments and features described in the Specification and the Drawings. However, not all of the features always need to be provided to obtain one or more advantages and/or effects.

It is to be noted that these general or specific aspects may be implemented using a system, a method, an integrated circuit, a computer program, or a recording medium, or any combination thereof.

BRIEF DESCRIPTION OF DRAWINGS

These and other objects, advantages and features of the disclosure will become apparent from the following description thereof taken in conjunction with the accompanying drawings that illustrate a specific embodiment of the present disclosure.

FIG. 1 is a block diagram illustrating a configuration of an encoder according to an embodiment;

FIG. 2 is a flow chart indicating one example of an overall encoding process performed by the encoder;

FIG. 3 is a conceptual diagram illustrating one example of block splitting;

FIG. 4A is a conceptual diagram illustrating one example of a slice configuration;

FIG. 4B is a conceptual diagram illustrating one example of a tile configuration;

FIG. 5A is a chart indicating transform basis functions for various transform types;

FIG. 5B is a conceptual diagram illustrating example spatially varying transforms (SVT);

FIG. 6A is a conceptual diagram illustrating one example of a filter shape used in an adaptive loop filter (ALF);

FIG. 6B is a conceptual diagram illustrating another example of a filter shape used in an ALF;

FIG. 6C is a conceptual diagram illustrating another example of a filter shape used in an ALF;

FIG. 7 is a block diagram indicating one example of a specific configuration of a loop filter which functions as a deblocking filter (DBF);

FIG. 8 is a conceptual diagram indicating an example of a deblocking filter having a symmetrical filtering characteristic with respect to a block boundary;

FIG. 9 is a conceptual diagram for illustrating a block boundary on which a deblocking filter process is performed;

FIG. 10 is a conceptual diagram indicating examples of Bs values;

FIG. 11 is a flow chart illustrating one example of a process performed by a prediction processor of the encoder;

FIG. 12 is a flow chart illustrating another example of a process performed by the prediction processor of the encoder;

FIG. 13 is a flow chart illustrating another example of a process performed by the prediction processor of the encoder;

FIG. 14 is a conceptual diagram illustrating sixty-seven intra prediction modes used in intra prediction in an embodiment;

FIG. 15 is a flow chart illustrating an example basic processing flow of inter prediction;

FIG. 16 is a flow chart illustrating one example of derivation of motion vectors;

FIG. 17 is a flow chart illustrating another example of derivation of motion vectors;

FIG. 18 is a flow chart illustrating another example of derivation of motion vectors;

FIG. 19 is a flow chart illustrating an example of inter prediction in normal inter mode;

FIG. 20 is a flow chart illustrating an example of inter prediction in merge mode;

FIG. 21 is a conceptual diagram for illustrating one example of a motion vector derivation process in merge mode;

FIG. 22 is a flow chart illustrating one example of frame rate up conversion (FRUC) process;

FIG. 23 is a conceptual diagram for illustrating one example of pattern matching (bilateral matching) between two blocks along a motion trajectory;

FIG. 24 is a conceptual diagram for illustrating one example of pattern matching (template matching) between a template in a current picture and a block in a reference picture;

FIG. 25A is a conceptual diagram for illustrating one example of deriving a motion vector of each sub-block based on motion vectors of a plurality of neighboring blocks;

FIG. 25B is a conceptual diagram for illustrating one example of deriving a motion vector of each sub-block in affine mode in which three control points are used;

FIG. 26A is a conceptual diagram for illustrating an affine merge mode;

FIG. 26B is a conceptual diagram for illustrating an affine merge mode in which two control points are used;

FIG. 26C is a conceptual diagram for illustrating an affine merge mode in which three control points are used;

FIG. 27 is a flow chart illustrating one example of a process in affine merge mode;

FIG. 28A is a conceptual diagram for illustrating an affine inter mode in which two control points are used;

FIG. 28B is a conceptual diagram for illustrating an affine inter mode in which three control points are used;

FIG. 29 is a flow chart illustrating one example of a process in affine inter mode;

FIG. 30A is a conceptual diagram for illustrating an affine inter mode in which a current block has three control points and a neighboring block has two control points;

FIG. 30B is a conceptual diagram for illustrating an affine inter mode in which a current block has two control points and a neighboring block has three control points;

FIG. 31A is a flow chart illustrating a merge mode process including decoder motion vector refinement (DMVR);

FIG. 31B is a conceptual diagram for illustrating one example of a DMVR process;

FIG. 32 is a flow chart illustrating one example of generation of a prediction image;

FIG. 33 is a flow chart illustrating another example of generation of a prediction image;

FIG. 34 is a flow chart illustrating another example of generation of a prediction image;

FIG. 35 is a flow chart illustrating one example of a prediction image correction process performed by an overlapped block motion compensation (OBMC) process;

FIG. 36 is a conceptual diagram for illustrating one example of a prediction image correction process performed by an OBMC process;

FIG. 37 is a conceptual diagram for illustrating generation of two triangular prediction images;

FIG. 38 is a conceptual diagram for illustrating a model assuming uniform linear motion;

FIG. 39 is a conceptual diagram for illustrating one example of a prediction image generation method using a luminance correction process performed by a local illumination compensation (LIC) process;

FIG. 40 is a block diagram illustrating a mounting example of the encoder;

FIG. 41 is a block diagram illustrating a configuration of a decoder according to an embodiment;

FIG. 42 is a flow chart illustrating one example of an overall decoding process performed by the decoder;

FIG. 43 is a flow chart illustrating one example of a process performed by a prediction processor of the decoder;

FIG. 44 is a flow chart illustrating another example of a process performed by the prediction processor of the decoder;

FIG. 45 is a flow chart illustrating an example of inter prediction in normal inter mode in the decoder;

FIG. 46 is a block diagram illustrating a mounting example of the decoder;

FIG. 47 is a flow chart indicating one example of an operation in quantization processing performed by an encoder according to Aspect 1;

FIG. 48 is a flow chart indicating one example of an operation in inverse quantization processing performed by a decoder according to Aspect 1;

FIG. 49 is a flow chart indicating one example of a flow of encoding using a quantization matrix (QM) in an encoder according to Aspect 2;

FIG. 50 is a flow chart indicating one example of a flow of decoding using a quantization matrix (QM) in a decoder according to Aspect 2;

FIG. 51 is a diagram for explaining a first example of generating a QM for a rectangular block based on a QM for a square block in Step S102 in FIG. 49 and in Step S202 in FIG. 50;

FIG. 52 is a diagram for explaining a method of generating the QM for the rectangular block explained with reference to FIG. 51 by down-converting the corresponding QM for the square block;

FIG. 53 is a diagram for explaining a second example of generating a QM for a rectangular block based on a QM for a square block in Step S102 in FIG. 49 and in Step S202 in FIG. 50;

FIG. 54 is a diagram for explaining a method of generating the QM for the rectangular block explained with reference to FIG. 53 by up-converting the corresponding QM for the square block;

FIG. 55 is a flow chart indicating one example of a flow of encoding using a quantization matrix (QM) in an encoder according to Aspect 3;

FIG. 56 is a flow chart indicating one example of a flow of decoding using a quantization matrix (QM) in a decoder according to Aspect 3;

FIG. 57 is a diagram for explaining an example of generating, for each of blocks which have various sizes, a QM corresponding to the size of an effective transform coefficient domain in the block, in each of Step S301 in FIG. 55 and in Step S401 in FIG. 56;

FIG. 58 is a flow chart indicating one example of a flow of encoding using a quantization matrix (QM) in an encoder according to a variation of Aspect 3;

FIG. 59 is a flow chart indicating one example of a flow of decoding using a quantization matrix (QM) in a decoder according to the variation of Aspect 3;

FIG. 60 is a diagram for explaining a first example of generating a QM for a rectangular block based on a QM for a square block in Step S502 in FIG. 58 and in Step S602 in FIG. 59;

FIG. 61 is a diagram for explaining a method of generating the QM for the rectangular block explained with reference to FIG. 60 by down-converting the corresponding QM for the square block;

FIG. 62 is a diagram for explaining a second example of generating a QM for a rectangular block based on a QM for a square block in Step S502 in FIG. 58 and in Step S602 in FIG. 59;

FIG. 63 is a diagram for explaining a method of generating the QM for the rectangular block with reference to FIG. 62 by up-converting the corresponding QM for the square block;

FIG. 64 is a flow chart indicating one example of a flow of encoding using a quantization matrix (QM) in an encoder according to Aspect 4;

FIG. 65 is a flow chart indicating one example of a flow of decoding using a quantization matrix (QM) in a decoder according to Aspect 4;

FIG. 66 is a diagram for explaining one example of generating, in each of Step S701 in FIG. 64 and in Step S801 in FIG. 65, a QM for a current block to be processed having one of various block sizes, based on values of quantized coefficients of a QM having only diagonal components in the current block using a common method;

FIG. 67 is a diagram for explaining another example of generating, in each of Step S701 in FIG. 64 and in Step S801 in FIG. 65, a QM for a current block to be processed having one of various block sizes, based on values of quantized coefficients of a QM having only diagonal components in the current block using a common method;

FIG. 68 is a block diagram illustrating an overall configuration of a content providing system for implementing a content distribution service;

FIG. 69 is a conceptual diagram illustrating one example of an encoding structure in scalable encoding;

FIG. 70 is a conceptual diagram illustrating one example of an encoding structure in scalable encoding;

FIG. 71 is a conceptual diagram illustrating an example of a display screen of a web page;

FIG. 72 is a conceptual diagram illustrating an example of a display screen of a web page;

FIG. 73 is a block diagram illustrating one example of a smartphone; and

FIG. 74 is a block diagram illustrating an example of a configuration of a smartphone.

DETAILED DESCRIPTION OF THE EMBODIMENTS

For example, an encoder according to an aspect of the present disclosure includes circuitry and memory coupled to the circuitry. In operation, the circuitry: performs quantization on a plurality of transform coefficients of a current block to be encoded, using a quantization matrix when orthogonal transform is performed on the current block and secondary transform is not performed on the current block; and performs quantization on the plurality of transform coefficients of the current block without using the quantization matrix when orthogonal transform is not performed on the current block and when both orthogonal transform and secondary transform are performed on the current block.

In this way, the encoder performs quantization, without using the quantization matrix, on the current block for which a sufficient effect of adjusting a subjective image quality may not be obtained even if the quantization matrix is applied, which reduces the processing amount. Furthermore, the encoder is capable of appropriately applying the quantization matrix to a plurality of prediction residuals of the orthogonal-transformed current block, which provides an effect of adjusting the subjective image quality. Accordingly, the encoder is capable of increasing the coding efficiency while reducing decrease in subjective image quality, both in a case in which the quantization matrix is applied and in a case in which the quantization matrix is not applied.

For example, the circuitry may determine whether to use the quantization matrix in the quantization on the current block, based on information indicating whether orthogonal transform has been performed on the current block and whether secondary transform has been performed on the plurality of transform coefficients of the current block.

In this way, the encoder is capable of appropriately determining whether to apply the quantization matrix to the current block in the quantization processing, and thus is capable of increasing the coding efficiency while reducing decrease in subjective image quality.

For example, when the current block is a rectangular block, the circuitry may: generate a second quantization matrix for the plurality of transform coefficients of the rectangular block by converting a first quantization matrix for a plurality of transform coefficients of a square block; and perform quantization on the plurality of transform coefficient of the rectangular block, using the second quantization matrix.

In this way, the encoder is capable of generating the quantization matrix corresponding to the rectangular block based on the quantization matrix corresponding to the square block, and thus there is no need for the encoder to encode a quantization matrix corresponding to the rectangular block. Furthermore, the encoder is capable of using the appropriate quantization matrix also for the rectangular block without increasing the amount of codes. Accordingly, the encoder is capable of efficiently quantizing rectangular blocks which have various shapes, and thus is capable of increasing the coding efficiency.

Furthermore, a decoder according to an aspect of the present disclosure includes circuitry and memory coupled to the circuitry. In operation, the circuitry: performs inverse quantization on a plurality of transform coefficients of a current block to be decoded, using a quantization matrix when inverse orthogonal transform is performed on the current block and inverse secondary transform is not performed on the current block; and performs inverse quantization on the plurality of transform coefficients of the current block without using the quantization matrix when inverse orthogonal transform is not performed on the current block and when both inverse orthogonal transform and inverse secondary transform are performed on the current block.

In this way, the decoder performs inverse quantization, without using the quantization matrix, on the current block for which a sufficient effect of adjusting a subjective image quality may not be obtained even if the quantization matrix is applied, which reduces the processing amount. Furthermore, the decoder is capable of appropriately applying the quantization matrix for the current block on which orthogonal transform, quantization, and encoding have been performed, which provides an effect of adjusting the subjective image quality. Accordingly, the decoder is capable of increasing the processing efficiency while reducing decrease in subjective image quality, both in the case in which the quantization matrix is applied and in the case in which the quantization matrix is not applied.

For example, the circuitry may determine whether to use the quantization matrix in the inverse quantization on the current block, based on information indicating whether inverse orthogonal transform has been performed on the current block and whether inverse secondary transform has been performed on the plurality of transform coefficients of the current block.

In this way, the decoder is capable of appropriately determining whether to use the quantization matrix for the current block in the inverse quantization processing, and thus is capable of increasing the processing efficiency while reducing decrease in subjective image quality.

For example, when the current block is a rectangular block, the circuitry may: generate a second quantization matrix for the plurality of transform coefficients of the rectangular block by converting a first quantization matrix for a plurality of transform coefficients of a square block; and perform quantization on the plurality of transform coefficient of the rectangular block, using the second quantization matrix.

In this way, the decoder is capable of generating the quantization matrix corresponding to the rectangular block based on the quantization matrix corresponding to the square block, and thus there is no need for the decoder to decode a quantization matrix corresponding to the rectangular block. Furthermore, the decoder is capable of using the appropriate quantization matrix also for the rectangular block without increasing the processing amount. Accordingly, the decoder is capable of efficiently quantizing rectangular blocks which have various shapes, and thus is capable of increasing the processing efficiency.

Furthermore, an encoding method according to an aspect of the present disclosure includes: performing quantization on a plurality of transform coefficients of a current block to be encoded, using a quantization matrix when orthogonal transform is performed on the current block and secondary transform is not performed on the current block; and performing quantization on the plurality of transform coefficients of the current block without using the quantization matrix when orthogonal transform is not performed on the current block and when both orthogonal transform and secondary transform are performed on the current block.

In this way, an apparatus which executes the encoding method performs quantization, without using the quantization matrix, on the current block for which a sufficient effect of adjusting a subjective image quality may not be obtained even if the quantization matrix is applied, which reduces the processing amount. Furthermore, the apparatus which executes the encoding method is capable of appropriately applying the quantization matrix to a plurality of prediction residuals of the orthogonal-transformed current block, which provides an effect of adjusting the subjective image quality. Accordingly, the apparatus which executes the encoding method is capable of increasing the coding efficiency while reducing decrease in subjective image quality, both in the case in which the quantization matrix is applied and in the case in which the quantization matrix is not applied.

Furthermore, a decoding method according to an aspect of the present disclosure includes: performing inverse quantization on a plurality of transform coefficients of a current block to be decoded, using a quantization matrix when inverse orthogonal transform is performed on the current block and inverse secondary transform is not performed on the current block; and performing inverse quantization on the plurality of transform coefficients of the current block without using the quantization matrix when inverse orthogonal transform is not performed on the current block and when both inverse orthogonal transform and inverse secondary transform are performed on the current block.

In this way, the apparatus which executes the decoding method performs inverse quantization, without using the quantization matrix, on the current block for which a sufficient effect of adjusting a subjective image quality may not be obtained even if the quantization matrix is applied, which reduces the processing amount. Furthermore, the apparatus which executes the decoding method is capable of appropriately applying the quantization matrix for the current block on which orthogonal transform, quantization, and encoding have been performed, which provides an effect of adjusting the subjective image quality. Accordingly, the apparatus which executes the decoding method is capable of increasing the processing efficiency while reducing decrease in subjective image quality, both in the case in which the quantization matrix is applied and in the case in which the quantization matrix is not applied.

These general and specific aspects may be implemented using a system, a device, a method, an integrated circuit, a computer program, or a computer-readable recording medium such as a CD-ROM, or any combination of systems, devices, methods, integrated circuits, computer programs, or computer-readable recording media.

Hereinafter, embodiments will be described with reference to the drawings. Note that the embodiments described below each show a general or specific example. The numerical values, shapes, materials, components, the arrangement and connection of the components, steps, the relation and order of the steps, etc., indicated in the following embodiments are mere examples, and are not intended to limit the scope of the claims.

Embodiments of an encoder and a decoder will be described below. The embodiments are examples of an encoder and a decoder to which the processes and/or configurations presented in the description of aspects of the present disclosure are applicable. The processes and/or configurations can also be implemented in an encoder and a decoder different from those according to the embodiments. For example, regarding the processes and/or configurations as applied to the embodiments, any of the following may be implemented:

(1) Any of the components of the encoder or the decoder according to the embodiments presented in the description of aspects of the present disclosure may be substituted or combined with another component presented anywhere in the description of aspects of the present disclosure.

(2) In the encoder or the decoder according to the embodiments, discretionary changes may be made to functions or processes performed by one or more components of the encoder or the decoder, such as addition, substitution, removal, etc., of the functions or processes. For example, any function or process may be substituted or combined with another function or process presented anywhere in the description of aspects of the present disclosure.

(3) In methods implemented by the encoder or the decoder according to the embodiments, discretionary changes may be made such as addition, substitution, and removal of one or more of the processes included in the method. For example, any process in the method may be substituted or combined with another process presented anywhere in the description of aspects of the present disclosure.

(4) One or more components included in the encoder or the decoder according to embodiments may be combined with a component presented anywhere in the description of aspects of the present disclosure, may be combined with a component including one or more functions presented anywhere in the description of aspects of the present disclosure, and may be combined with a component that implements one or more processes implemented by a component presented in the description of aspects of the present disclosure.

(5) A component including one or more functions of the encoder or the decoder according to the embodiments, or a component that implements one or more processes of the encoder or the decoder according to the embodiments, may be combined or substituted with a component presented anywhere in the description of aspects of the present disclosure, with a component including one or more functions presented anywhere in the description of aspects of the present disclosure, or with a component that implements one or more processes presented anywhere in the description of aspects of the present disclosure.

(6) In methods implemented by the encoder or the decoder according to the embodiments, any of the processes included in the method may be substituted or combined with a process presented anywhere in the description of aspects of the present disclosure or with any corresponding or equivalent process.

(7) One or more processes included in methods implemented by the encoder or the decoder according to the embodiments may be combined with a process presented anywhere in the description of aspects of the present disclosure.

(8) The implementation of the processes and/or configurations presented in the description of aspects of the present disclosure is not limited to the encoder or the decoder according to the embodiments. For example, the processes and/or configurations may be implemented in a device used for a purpose different from the moving picture encoder or the moving picture decoder disclosed in the embodiments.

[Encoder]

First, an encoder according to an embodiment will be described. FIG. 1 is a block diagram illustrating a configuration of encoder 100 according to the embodiment. Encoder 100 is a video encoder which encodes a video in units of a block.

As illustrated in FIG. 1, encoder 100 is an apparatus which encodes an image in units of a block, and includes splitter 102, subtractor 104, transformer 106, quantizer 108, entropy encoder 110, inverse quantizer 112, inverse transformer 114, adder 116, block memory 118, loop filter 120, frame memory 122, intra predictor 124, inter predictor 126, and prediction controller 128.

Encoder 100 is implemented as, for example, a generic processor and memory. In this case, when a software program stored in the memory is executed by the processor, the processor functions as splitter 102, subtractor 104, transformer 106, quantizer 108, entropy encoder 110, inverse quantizer 112, inverse transformer 114, adder 116, loop filter 120, intra predictor 124, inter predictor 126, and prediction controller 128. Alternatively, encoder 100 may be implemented as one or more dedicated electronic circuits corresponding to splitter 102, subtractor 104, transformer 106, quantizer 108, entropy encoder 110, inverse quantizer 112, inverse transformer 114, adder 116, loop filter 120, intra predictor 124, inter predictor 126, and prediction controller 128.

Hereinafter, an overall flow of processes performed by encoder 100 is described, and then each of constituent elements included in encoder 100 will be described.

[Overall Flow of Encoding Process]

FIG. 2 is a flow chart indicating one example of an overall encoding process performed by encoder 100.

First, splitter 102 of encoder 100 splits each of pictures included in an input image which is a video into a plurality of blocks having a fixed size (e.g., 128×128 pixels) (Step Sa_1). Splitter 102 then selects a splitting pattern for the fixed-size block (also referred to as a block shape) (Step Sa_2). In other words, splitter 102 further splits the fixed-size block into a plurality of blocks which form the selected splitting pattern. Encoder 100 performs, for each of the plurality of blocks, Steps Sa_3 to Sa_9 for the block (that is a current block to be encoded).

In other words, a prediction processor which includes all or part of intra predictor 124, inter predictor 126, and prediction controller 128 generates a prediction signal (also referred to as a prediction block) of the current block to be encoded (also referred to as a current block) (Step Sa_3).

Next, subtractor 104 generates a difference between the current block and a prediction block as a prediction residual (also referred to as a difference block) (Step Sa_4).

Next, transformer 106 transforms the difference block and quantizer 108 quantizes the result, to generate a plurality of quantized coefficients (Step Sa_5). It is to be noted that the block having the plurality of quantized coefficients is also referred to as a coefficient block.

Next, entropy encoder 110 encodes (specifically, entropy encodes) the coefficient block and a prediction parameter related to generation of a prediction signal to generate an encoded signal (Step Sa_6). It is to be noted that the encoded signal is also referred to as an encoded bitstream, a compressed bitstream, or a stream.

Next, inverse quantizer 112 performs inverse quantization of the coefficient block and inverse transformer 114 performs inverse transform of the result, to restore a plurality of prediction residuals (that is, a difference block) (Step Sa_7).

Next, adder 116 adds the prediction block to the restored difference block to reconstruct the current block as a reconstructed image (also referred to as a reconstructed block or a decoded image block) (Step Sa_8). In this way, the reconstructed image is generated.

When the reconstructed image is generated, loop filter 120 performs filtering of the reconstructed image as necessary (Step Sa_9).

Encoder 100 then determines whether encoding of the entire picture has been finished (Step Sa_10). When determining that the encoding has not yet been finished (No in Step Sa_10), processes from Step Sa_2 are executed repeatedly.

Although encoder 100 selects one splitting pattern for a fixed-size block, and encodes each block according to the splitting pattern in the above-described example, it is to be noted that each block may be encoded according to a corresponding one of a plurality of splitting patterns. In this case, encoder 100 may evaluate a cost for each of the plurality of splitting patterns, and, for example, may select the encoded signal obtainable by encoding according to the splitting pattern which yields the smallest cost as an encoded signal which is output.

As illustrated, the processes in Steps Sa_1 to Sa_10 are performed sequentially by encoder 100. Alternatively, two or more of the processes may be performed in parallel, the processes may be reordered, etc.

[Splitter]

Splitter 102 splits each of pictures included in an input video into a plurality of blocks, and outputs each block to subtractor 104. For example, splitter 102 first splits a picture into blocks of a fixed size (for example, 128×128). Other fixed block sizes may be employed. The fixed-size block is also referred to as a coding tree unit (CTU). Splitter 102 then splits each fixed-size block into blocks of variable sizes (for example, 64×64 or smaller), based on recursive quadtree and/or binary tree block splitting. In other words, splitter 102 selects a splitting pattern. The variable-size block is also referred to as a coding unit (CU), a prediction unit (PU), or a transform unit (TU). It is to be noted that, in various kinds of processing examples, there is no need to differentiate between CU, PU, and TU; all or some of the blocks in a picture may be processed in units of a CU, a PU, or a TU.

FIG. 3 is a conceptual diagram illustrating one example of block splitting according to an embodiment. In FIG. 3, the solid lines represent block boundaries of blocks split by quadtree block splitting, and the dashed lines represent block boundaries of blocks split by binary tree block splitting.

Here, block 10 is a square block having 128×128 pixels (128×128 block). This 128×128 block 10 is first split into four square 64×64 blocks (quadtree block splitting).

The upper-left 64×64 block is further vertically split into two rectangular 32×64 blocks, and the left 32×64 block is further vertically split into two rectangular 16×64 blocks (binary tree block splitting). As a result, the upper-left 64×64 block is split into two 16×64 blocks 11 and 12 and one 32×64 block 13.

The upper-right 64×64 block is horizontally split into two rectangular 64×32 blocks 14 and 15 (binary tree block splitting).

The lower-left 64×64 block is first split into four square 32×32 blocks (quadtree block splitting). The upper-left block and the lower-right block among the four 32×32 blocks are further split. The upper-left 32×32 block is vertically split into two rectangle 16×32 blocks, and the right 16×32 block is further horizontally split into two 16×16 blocks (binary tree block splitting). The lower-right 32×32 block is horizontally split into two 32×16 blocks (binary tree block splitting). As a result, the lower-left 64×64 block is split into 16×32 block 16, two 16×16 blocks 17 and 18, two 32×32 blocks 19 and 20, and two 32×16 blocks 21 and 22.

The lower-right 64×64 block 23 is not split.

As described above, in FIG. 3, block 10 is split into thirteen variable-size blocks 11 through 23 based on recursive quadtree and binary tree block splitting. This type of splitting is also referred to as quadtree plus binary tree (QTBT) splitting.

It is to be noted that, in FIG. 3, one block is split into four or two blocks (quadtree or binary tree block splitting), but splitting is not limited to these examples. For example, one block may be split into three blocks (ternary block splitting). Splitting including such ternary block splitting is also referred to as multi-type tree (MBT) splitting.

[Picture Structure: Slice/Tile]

A picture may be configured in units of one or more slices or tiles in order to decode the picture in parallel. The picture configured in units of one or more slices or tiles may be configured by splitter 102.

Slices are basic encoding units included in a picture. A picture may include, for example, one or more slices. In addition, a slice includes one or more successive coding tree units (CTU).

FIG. 4A is a conceptual diagram illustrating one example of a slice configuration. For example, a picture includes 11×8 CTUs and is split into four slices (slices 1 to 4). Slice 1 includes sixteen CTUs, slice 2 includes twenty-one CTUs, slice 3 includes twenty-nine CTUs, and slice 4 includes twenty-two CTUs. Here, each CTU in the picture belongs to one of the slices. The shape of each slice is a shape obtainable by splitting the picture horizontally. A boundary of each slice does not need to be coincide with an image end, and may be coincide with any of the boundaries between CTUs in the image. The processing order of the CTUs in a slice (an encoding order or a decoding order) is, for example, a raster-scan order. A slice includes header information and encoded data. Features of the slice may be described in header information. The features include a CTU address of a top CTU in the slice, a slice type, etc.

A tile is a unit of a rectangular region included in a picture. Each of tiles may be assigned with a number referred to as TileId in raster-scan order.

FIG. 4B is a conceptual diagram indicating an example of a tile configuration. For example, a picture includes 11×8 CTUs and is split into four tiles of rectangular regions (tiles 1 to 4). When tiles are used, the processing order of CTUs are changed from the processing order in the case where no tile is used. When no tile is used, CTUs in a picture are processed in raster-scan order. When tiles are used, at least one CTU in each of the tiles is processed in raster-scan order. For example, as illustrated in FIG. 4B, the processing order of the CTUs included in tile 1 is the order which starts from the left-end of the first row of tile 1 toward the right-end of the first row of tile 1 and then starts from the left-end of the second row of tile 1 toward the right-end of the second row of tile 1.

It is to be noted that the one tile may include one or more slices, and one slice may include one or more tiles.

[Subtractor]

Subtractor 104 subtracts a prediction signal (prediction sample that is input from prediction controller 128 indicated below) from an original signal (original sample) in units of a block input from splitter 102 and split by splitter 102. In other words, subtractor 104 calculates prediction errors (also referred to as residuals) of a block to be encoded (hereinafter also referred to as a current block). Subtractor 104 then outputs the calculated prediction errors (residuals) to transformer 106.

The original signal is a signal which has been input into encoder 100 and represents an image of each picture included in a video (for example, a luma signal and two chroma signals). Hereinafter, a signal representing an image is also referred to as a sample.

[Transformer]

Transformer 106 transforms prediction errors in spatial domain into transform coefficients in frequency domain, and outputs the transform coefficients to quantizer 108. More specifically, transformer 106 applies, for example, a defined discrete cosine transform (DCT) or discrete sine transform (DST) to prediction errors in spatial domain. The defined DCT or DST may be predefined.

It is to be noted that transformer 106 may adaptively select a transform type from among a plurality of transform types, and transform prediction errors into transform coefficients by using a transform basis function corresponding to the selected transform type. This sort of transform is also referred to as explicit multiple core transform (EMT) or adaptive multiple transform (AMT).

The transform types include, for example, DCT-II, DCT-V, DCT-VIII, DST-I, and DST-VII. FIG. 5A is a chart indicating transform basis functions for the example transform types. In FIG. 5A, N indicates the number of input pixels. For example, selection of a transform type from among the plurality of transform types may depend on a prediction type (one of intra prediction and inter prediction), and may depend on an intra prediction mode.

Information indicating whether to apply such EMT or AMT (referred to as, for example, an EMT flag or an AMT flag) and information indicating the selected transform type is normally signaled at the CU level. It is to be noted that the signaling of such information does not necessarily need to be performed at the CU level, and may be performed at another level (for example, at the bit sequence level, picture level, slice level, tile level, or CTU level).

In addition, transformer 106 may re-transform the transform coefficients (transform result). Such re-transform is also referred to as adaptive secondary transform (AST) or non-separable secondary transform (NSST). For example, transformer 106 performs re-transform in units of a sub-block (for example, 4×4 sub-block) included in a transform coefficient block corresponding to an intra prediction error. Information indicating whether to apply NSST and information related to a transform matrix for use in NSST are normally signaled at the CU level. It is to be noted that the signaling of such information does not necessarily need to be performed at the CU level, and may be performed at another level (for example, at the sequence level, picture level, slice level, tile level, or CTU level).

Transformer 106 may employ a separable transform and a non-separable transform. A separable transform is a method in which a transform is performed a plurality of times by separately performing a transform for each of a number of directions according to the number of dimensions of inputs. A non-separable transform is a method of performing a collective transform in which two or more dimensions in multidimensional inputs are collectively regarded as a single dimension.

In one example of a non-separable transform, when an input is a 4×4 block, the 4×4 block is regarded as a single array including sixteen elements, and the transform applies a 16×16 transform matrix to the array.

In another example of a non-separable transform, a 4×4 input block is regarded as a single array including sixteen elements, and then a transform (hypercube givens transform) in which givens revolution is performed on the array a plurality of times may be performed.

In the transform in transformer 106, the types of bases to be transformed into the frequency domain according to regions in a CU can be switched. Examples include spatially varying transforms (SVT). In SVT, as illustrated in FIG. 5B, CUs are split into two equal regions horizontally or vertically, and only one of the regions is transformed into the frequency domain. A transform basis type can be set for each region. For example, DST7 and DST8 are used. In this example, only one of these two regions in the CU is transformed, and the other is not transformed. However, both of these two regions may be transformed. In addition, the splitting method is not limited to the splitting into two equal regions, and can be more flexible. For example, the CU may be split into four equal regions, or information indicating splitting may be encoded separately and be signaled in the same manner as the CU splitting. It is to be noted that SVT is also referred to as sub-block transform (SBT).

[Quantizer]

Quantizer 108 quantizes the transform coefficients output from transformer 106. More specifically, quantizer 108 scans, in a determined scanning order, the transform coefficients of the current block, and quantizes the scanned transform coefficients based on quantization parameters (QP) corresponding to the transform coefficients. Quantizer 108 then outputs the quantized transform coefficients (hereinafter also referred to as quantized coefficients) of the current block to entropy encoder 110 and inverse quantizer 112. The determined scanning order may be predetermined.

A determined scanning order is an order for quantizing/inverse quantizing transform coefficients. For example, a determined scanning order may be defined as ascending order of frequency (from low to high frequency) or descending order of frequency (from high to low frequency).

A quantization parameter (QP) is a parameter defining a quantization step (quantization width). For example, when the value of the quantization parameter increases, the quantization step also increases. In other words, when the value of the quantization parameter increases, the quantization error increases.

In addition, a quantization matrix may be used for quantization. For example, several kinds of quantization matrices may be used correspondingly to frequency transform sizes such as 4×4 and 8×8, prediction modes such as intra prediction and inter prediction, and pixel components such as luma and chroma pixel components. It is to be noted that quantization means digitalizing values sampled at determined intervals correspondingly to determined levels. In this technical field, quantization may be referred to using other expressions, such as rounding and scaling, and may employ rounding and scaling. The determined intervals and levels may be predetermined.

Methods using quantization matrices include a method using a quantization matrix which has been set directly at the encoder side and a method using a quantization matrix which has been set as a default (default matrix). At the encoder side, a quantization matrix suitable for features of an image can be set by directly setting a quantization matrix. This case, however, has a disadvantage of increasing a coding amount for encoding the quantization matrix.

There is a method for quantizing a high-frequency coefficient and a low-frequency coefficient without using a quantization matrix. It is to be noted that this method is equivalent to a method using a quantization matrix (flat matrix) whose coefficients have the same value.

The quantization matrix may be specified using, for example, a sequence parameter set (SPS) or a picture parameter set (PPS). The SPS includes a parameter which is used for a sequence, and the PPS includes a parameter which is used for a picture. Each of the SPS and the PPS may be simply referred to as a parameter set.

[Entropy Encoder]

Entropy encoder 110 generates an encoded signal (encoded bitstream) based on quantized coefficients which have been input from quantizer 108. More specifically, entropy encoder 110, for example, binarizes quantized coefficients, and arithmetically encodes the binary signal, and outputs a compressed bit stream or sequence.

[Inverse Quantizer]

Inverse quantizer 112 inverse quantizes quantized coefficients which have been input from quantizer 108. More specifically, inverse quantizer 112 inverse quantizes, in a determined scanning order, quantized coefficients of the current block. Inverse quantizer 112 then outputs the inverse quantized transform coefficients of the current block to inverse transformer 114. The determined scanning order may be predetermined.

[Inverse Transformer]

Inverse transformer 114 restores prediction errors (residuals) by inverse transforming transform coefficients which have been input from inverse quantizer 112. More specifically, inverse transformer 114 restores the prediction errors of the current block by applying an inverse transform corresponding to the transform applied by transformer 106 on the transform coefficients. Inverse transformer 114 then outputs the restored prediction errors to adder 116.

It is to be noted that since information is lost in quantization, the restored prediction errors do not match the prediction errors calculated by subtractor 104. In other words, the restored prediction errors normally include quantization errors.

[Adder]

Adder 116 reconstructs the current block by adding prediction errors which have been input from inverse transformer 114 and prediction samples which have been input from prediction controller 128. Adder 116 then outputs the reconstructed block to block memory 118 and loop filter 120. A reconstructed block is also referred to as a local decoded block.

[Block Memory]

Block memory 118 is, for example, storage for storing blocks in a picture to be encoded (hereinafter referred to as a current picture) which is referred to in intra prediction. More specifically, block memory 118 stores reconstructed blocks output from adder 116.

[Frame Memory]

Frame memory 122 is, for example, storage for storing reference pictures for use in inter prediction, and is also referred to as a frame buffer. More specifically, frame memory 122 stores reconstructed blocks filtered by loop filter 120.

[Loop Filter]

Loop filter 120 applies a loop filter to blocks reconstructed by adder 116, and outputs the filtered reconstructed blocks to frame memory 122. A loop filter is a filter used in an encoding loop (in-loop filter), and includes, for example, a deblocking filter (DF or DBF), a sample adaptive offset (SAO), and an adaptive loop filter (ALF).

In an ALF, a least square error filter for removing compression artifacts is applied. For example, one filter selected from among a plurality of filters based on the direction and activity of local gradients is applied for each of 2×2 sub-blocks in the current block.

More specifically, first, each sub-block (for example, each 2×2 sub-block) is categorized into one out of a plurality of classes (for example, fifteen or twenty-five classes). The classification of the sub-block is based on gradient directionality and activity. For example, classification index C (for example, C=5D+A) is derived based on gradient directionality D (for example, 0 to 2 or 0 to 4) and gradient activity A (for example, 0 to 4). Then, based on classification index C, each sub-block is categorized into one out of a plurality of classes.

For example, gradient directionality D is calculated by comparing gradients of a plurality of directions (for example, the horizontal, vertical, and two diagonal directions). Moreover, for example, gradient activity A is calculated by adding gradients of a plurality of directions and quantizing the result of addition.

The filter to be used for each sub-block is determined from among the plurality of filters based on the result of such categorization.

The filter shape to be used in an ALF is, for example, a circular symmetric filter shape. FIG. 6A through FIG. 6C illustrate examples of filter shapes used in ALFs. FIG. 6A illustrates a 5×5 diamond shape filter, FIG. 6B illustrates a 7×7 diamond shape filter, and FIG. 6C illustrates a 9×9 diamond shape filter. Information indicating the filter shape is normally signaled at the picture level. It is to be noted that the signaling of such information indicating the filter shape does not necessarily need to be performed at the picture level, and may be performed at another level (for example, at the sequence level, slice level, tile level, CTU level, or CU level).

The ON or OFF of the ALF is determined, for example, at the picture level or CU level. For example, the decision of whether to apply the ALF to luma may be made at the CU level, and the decision of whether to apply ALF to chroma may be made at the picture level. Information indicating ON or OFF of the ALF is normally signaled at the picture level or CU level. It is to be noted that the signaling of information indicating ON or OFF of the ALF does not necessarily need to be performed at the picture level or CU level, and may be performed at another level (for example, at the sequence level, slice level, tile level, or CTU level).

The coefficient set for the plurality of selectable filters (for example, fifteen or up to twenty-five filters) is normally signaled at the picture level. It is to be noted that the signaling of the coefficient set does not necessarily need to be performed at the picture level, and may be performed at another level (for example, at the sequence level, slice level, tile level, CTU level, CU level, or sub-block level).

[Loop Filter>Deblocking Filter]

In a deblocking filter, loop filter 120 performs a filter process on a block boundary in a reconstructed image so as to reduce distortion which occurs at the block boundary.

FIG. 7 is a block diagram illustrating one example of a specific configuration of loop filter 120 which functions as a deblocking filter.

Loop filter 120 includes: boundary determiner 1201; filter determiner 1203; filtering executor 1205; process determiner 1208; filter characteristic determiner 1207; and switches 1202, 1204, and 1206.

Boundary determiner 1201 determines whether a pixel to be deblock-filtered (that is, a current pixel) is present around a block boundary. Boundary determiner 1201 then outputs the determination result to switch 1202 and processing determiner 1208.

In the case where boundary determiner 1201 has determined that a current pixel is present around a block boundary, switch 1202 outputs an unfiltered image to switch 1204. In the opposite case where boundary determiner 1201 has determined that no current pixel is present around a block boundary, switch 1202 outputs an unfiltered image to switch 1206.

Filter determiner 1203 determines whether to perform deblocking filtering of the current pixel, based on the pixel value of at least one surrounding pixel located around the current pixel. Filter determiner 1203 then outputs the determination result to switch 1204 and processing determiner 1208.

In the case where filter determiner 1203 has determined to perform deblocking filtering of the current pixel, switch 1204 outputs the unfiltered image obtained through switch 1202 to filtering executor 1205. In the opposite case were filter determiner 1203 has determined not to perform deblocking filtering of the current pixel, switch 1204 outputs the unfiltered image obtained through switch 1202 to switch 1206.

When obtaining the unfiltered image through switches 1202 and 1204, filtering executor 1205 executes, for the current pixel, deblocking filtering with the filter characteristic determined by filter characteristic determiner 1207. Filtering executor 1205 then outputs the filtered pixel to switch 1206.

Under control by processing determiner 1208, switch 1206 selectively outputs a pixel which has not been deblock-filtered and a pixel which has been deblock-filtered by filtering executor 1205.

Processing determiner 1208 controls switch 1206 based on the results of determinations made by boundary determiner 1201 and filter determiner 1203. In other words, processing determiner 1208 causes switch 1206 to output the pixel which has been deblock-filtered when boundary determiner 1201 has determined that the current pixel is present around the block boundary and filter determiner 1203 has determined to perform deblocking filtering of the current pixel. In addition, other than the above case, processing determiner 1208 causes switch 1206 to output the pixel which has not been deblock-filtered. A filtered image is output from switch 1206 by repeating output of a pixel in this way.

FIG. 8 is a conceptual diagram indicating an example of a deblocking filter having a symmetrical filtering characteristic with respect to a block boundary.

In a deblocking filter process, one of two deblocking filters having different characteristics, that is, a strong filter and a weak filter is selected using pixel values and quantization parameters. In the case of the strong filter, pixels p0 to p2 and pixels q0 to q2 are present across a block boundary as illustrated in FIG. 8, the pixel values of the respective pixel q0 to q2 are changed to pixel values q′0 to q′2 by performing, for example, computations according to the expressions below.

q′0=(p1+2×p0+2×q0+2×q1+q2+4)/8

q′1=(p0+q0+q1+q2+2)/4

q′2=(p0+q0+q1+3×q2+2×q3+4)/8

It is to be noted that, in the above expressions, p0 to p2 and q0 to q2 are the pixel values of respective pixels p0 to p2 and pixels q0 to q2. In addition, q3 is the pixel value of neighboring pixel q3 located at the opposite side of pixel q2 with respect to the block boundary. In addition, in the right side of each of the expressions, coefficients which are multiplied with the respective pixel values of the pixels to be used for deblocking filtering are filter coefficients.

Furthermore, in the deblocking filtering, clipping may be performed so that the calculated pixel values are not set over a threshold value. In the clipping process, the pixel values calculated according to the above expressions are clipped to a value obtained according to “a computation pixel value±2×a threshold value” using the threshold value determined based on a quantization parameter. In this way, it is possible to prevent excessive smoothing.

FIG. 9 is a conceptual diagram for illustrating a block boundary on which a deblocking filter process is performed. FIG. 10 is a conceptual diagram indicating examples of Bs values.

The block boundary on which the deblocking filter process is performed is, for example, a boundary between prediction units (PU) having 8×8 pixel blocks as illustrated in FIG. 9 or a boundary between transform units (TU). The deblocking filter process may be performed in units of four rows or four columns. First, boundary strength (Bs) values are determined as indicated in FIG. 10 for block P and block Q illustrated in FIG. 9.

According to the Bs values in FIG. 10, whether to perform deblocking filter processes of block boundaries belonging to the same image using different strengths is determined. The deblocking filter process for a chroma signal is performed when a Bs value is 2. The deblocking filter process for a luma signal is performed when a Bs value is 1 or more and a determined condition is satisfied. The determined condition may be predetermined. It is to be noted that conditions for determining Bs values are not limited to those indicated in FIG. 10, and a Bs value may be determined based on another parameter.

[Prediction Processor (Intra Predictor, Inter Predictor, Prediction Controller)]

FIG. 11 is a flow chart illustrating one example of a process performed by the prediction processor of encoder 100. It is to be noted that the prediction processor includes all or part of the following constituent elements: intra predictor 124; inter predictor 126; and prediction controller 128.

The prediction processor generates a prediction image of a current block (Step Sb_1). This prediction image is also referred to as a prediction signal or a prediction block. It is to be noted that the prediction signal is, for example, an intra prediction signal or an inter prediction signal. Specifically, the prediction processor generates the prediction image of the current block using a reconstructed image which has been already obtained through generation of a prediction block, generation of a difference block, generation of a coefficient block, restoring of a difference block, and generation of a decoded image block.

The reconstructed image may be, for example, an image in a reference picture, or an image of an encoded block in a current picture which is the picture including the current block. The encoded block in the current picture is, for example, a neighboring block of the current block.

FIG. 12 is a flow chart illustrating another example of a process performed by the prediction processor of encoder 100.

The prediction processor generates a prediction image using a first method (Step Sc_1 a), generates a prediction image using a second method (Step Sc_1 b), and generates a prediction image using a third method (Step Sc_1 c). The first method, the second method, and the third method may be mutually different methods for generating a prediction image. Each of the first to third methods may be an inter prediction method, an intra prediction method, or another prediction method. The above-described reconstructed image may be used in these prediction methods.

Next, the prediction processor selects any one of a plurality of prediction methods generated in Steps Sc_1 a, Sc_1 b, and Sc_1 c (Step Sc_2). The selection of the prediction image, that is selection of a method or a mode for obtaining a final prediction image may be made by calculating a cost for each of the generated prediction images and based on the cost. Alternatively, the selection of the prediction image may be made based on a parameter which is used in an encoding process. Encoder 100 may transform information for identifying a selected prediction image, a method, or a mode into an encoded signal (also referred to as an encoded bitstream). The information may be, for example, a flag or the like. In this way, the decoder is capable of generating a prediction image according to the method or the mode selected based on the information in encoder 100. It is to be noted that, in the example illustrated in FIG. 12, the prediction processor selects any of the prediction images after the prediction images are generated using the respective methods. However, the prediction processor may select a method or a mode based on a parameter for use in the above-described encoding process before generating prediction images, and may generate a prediction image according to the method or mode selected.

For example, the first method and the second method may be intra prediction and inter prediction, respectively, and the prediction processor may select a final prediction image for a current block from prediction images generated according to the prediction methods.

FIG. 13 is a flow chart illustrating another example of a process performed by the prediction processor of encoder 100.

First, the prediction processor generates a prediction image using intra prediction (Step Sd_1 a), and generates a prediction image using inter prediction (Step Sd_1 b). It is to be noted that the prediction image generated by intra prediction is also referred to as an intra prediction image, and the prediction image generated by inter prediction is also referred to as an inter prediction image.

Next, the prediction processor evaluates each of the intra prediction image and the inter prediction image (Step Sd_2). A cost may be used in the evaluation. In other words, the prediction processor calculates cost C for each of the intra prediction image and the inter prediction image. Cost C may be calculated according to an expression of an R-D optimization model, for example, C=D+λ×R. In this expression, D indicates a coding distortion of a prediction image, and is represented as, for example, a sum of absolute differences between the pixel value of a current block and the pixel value of a prediction image. In addition, R indicates a predicted coding amount of a prediction image, specifically, the coding amount required to encode motion information for generating a prediction image, etc. In addition, A indicates, for example, a multiplier according to the method of Lagrange multiplier.

The prediction processor then selects the prediction image for which the smallest cost C has been calculated among the intra prediction image and the inter prediction image, as the final prediction image for the current block (Step Sd_3). In other words, the prediction method or the mode for generating the prediction image for the current block is selected.

[Intra Predictor]

Intra predictor 124 generates a prediction signal (intra prediction signal) by performing intra prediction (also referred to as intra frame prediction) of the current block by referring to a block or blocks in the current picture and stored in block memory 118. More specifically, intra predictor 124 generates an intra prediction signal by performing intra prediction by referring to samples (for example, luma and/or chroma values) of a block or blocks neighboring the current block, and then outputs the intra prediction signal to prediction controller 128.

For example, intra predictor 124 performs intra prediction by using one mode from among a plurality of intra prediction modes which have been defined. The intra prediction modes include one or more non-directional prediction modes and a plurality of directional prediction modes. The defined modes may be predefined.

The one or more non-directional prediction modes include, for example, the planar prediction mode and DC prediction mode defined in the H.265/high-efficiency video coding (HEVC) standard.

The plurality of directional prediction modes include, for example, the thirty-three directional prediction modes defined in the H.265/HEVC standard. It is to be noted that the plurality of directional prediction modes may further include thirty-two directional prediction modes in addition to the thirty-three directional prediction modes (for a total of sixty-five directional prediction modes). FIG. 14 is a conceptual diagram illustrating sixty-seven intra prediction modes in total that may be used in intra prediction (two non-directional prediction modes and sixty-five directional prediction modes). The solid arrows represent the thirty-three directions defined in the H.265/HEVC standard, and the dashed arrows represent the additional thirty-two directions (the two non-directional prediction modes are not illustrated in FIG. 14).

In various kinds of processing examples, a luma block may be referred to in intra prediction of a chroma block. In other words, a chroma component of the current block may be predicted based on a luma component of the current block. Such intra prediction is also referred to as cross-component linear model (CCLM) prediction. The intra prediction mode for a chroma block in which such a luma block is referred to (also referred to as, for example, a CCLM mode) may be added as one of the intra prediction modes for chroma blocks.

Intra predictor 124 may correct intra-predicted pixel values based on horizontal/vertical reference pixel gradients. Intra prediction accompanied by this sort of correcting is also referred to as position dependent intra prediction combination (PDPC). Information indicating whether to apply PDPC (referred to as, for example, a PDPC flag) is normally signaled at the CU level. It is to be noted that the signaling of such information does not necessarily need to be performed at the CU level, and may be performed at another level (for example, at the sequence level, picture level, slice level, tile level, or CTU level).

[Inter Predictor]

Inter predictor 126 generates a prediction signal (inter prediction signal) by performing inter prediction (also referred to as inter frame prediction) of the current block by referring to a block or blocks in a reference picture, which is different from the current picture and is stored in frame memory 122. Inter prediction is performed in units of a current block or a current sub-block (for example, a 4×4 block) in the current block. For example, inter predictor 126 performs motion estimation in a reference picture for the current block or the current sub-block, and finds out a reference block or a sub-block which best matches the current block or the current sub-block. Inter predictor 126 then obtains motion information (for example, a motion vector) which compensates a motion or a change from the reference block or the sub-block to the current block or the sub-block. Inter predictor 126 generates an inter prediction signal of the current block or the sub-block by performing motion compensation (or motion prediction) based on the motion information. Inter predictor 126 outputs the generated inter prediction signal to prediction controller 128.

The motion information used in motion compensation may be signaled as inter prediction signals in various forms. For example, a motion vector may be signaled. As another example, the difference between a motion vector and a motion vector predictor may be signaled.

[Basic Flow of Inter Prediction]

FIG. 15 is a flow chart illustrating an example basic processing flow of inter prediction.

First, inter predictor 126 generates a prediction signal (Steps Se_1 to Se_3). Next, subtractor 104 generates the difference between a current block and a prediction image as a prediction residual (Step Se_4).

Here, in the generation of the prediction image, inter predictor 126 generates the prediction image through determination of a motion vector (MV) of the current block (Steps Se_1 and Se_2) and motion compensation (Step Se_3). Furthermore, in determination of an MV, inter predictor 126 determines the MV through selection of a motion vector candidate (MV candidate) (Step Se_1) and derivation of an MV (Step Se_2). The selection of the MV candidate is made by, for example, selecting at least one MV candidate from an MV candidate list. Alternatively, in derivation of an MV, inter predictor 126 may further select at least one MV candidate from the at least one MV candidate, and determine the selected at least one MV candidate as the MV for the current block. Alternatively, inter predictor 126 may determine the MV for the current block by performing estimation in a reference picture region specified by each of the selected at least one MV candidate. It is to be noted that the estimation in a reference picture region may be referred to as motion estimation.

In addition, although Steps Se_1 to Se_3 are performed by inter predictor 126 in the above-described example, a process that is for example Step Se_1, Step Se_2, or the like may be performed by another constituent element included in encoder 100.

[Motion Vector Derivation Flow]

FIG. 16 is a flow chart illustrating one example of derivation of motion vectors.

Inter predictor 126 derives an MV of a current block in a mode for encoding motion information (for example, an MV). In this case, for example, the motion information is encoded as a prediction parameter, and is signaled. In other words, the encoded motion information is included in an encoded signal (also referred to as an encoded bitstream).

Alternatively, inter predictor 126 derives an MV in a mode in which motion information is not encoded. In this case, no motion information is included in an encoded signal.

Here, MV derivation modes may include a normal inter mode, a merge mode, a FRUC mode, an affine mode, etc. which are described later. Modes in which motion information is encoded among the modes include the normal inter mode, the merge mode, the affine mode (specifically, an affine inter mode and an affine merge mode), etc. It is to be noted that motion information may include not only an MV but also motion vector predictor selection information which is described later. Modes in which no motion information is encoded include the FRUC mode, etc. Inter predictor 126 selects a mode for deriving an MV of the current block from the modes, and derives the MV of the current block using the selected mode.

FIG. 17 is a flow chart illustrating another example of derivation of motion vectors.

Inter predictor 126 derives an MV of a current block in a mode in which an MV difference is encoded. In this case, for example, the MV difference is encoded as a prediction parameter, and is signaled. In other words, the encoded MV difference is included in an encoded signal. The MV difference is the difference between the MV of the current block and the MV predictor.

Alternatively, inter predictor 126 derives an MV in a mode in which no MV difference is encoded. In this case, no encoded MV difference is included in an encoded signal.

Here, as described above, the MV derivation modes include the normal inter mode, the merge mode, the FRUC mode, the affine mode, etc. which are described later. Modes in which an MV difference is encoded among the modes include the normal inter mode, the affine mode (specifically, the affine inter mode), etc. Modes in which no MV difference is encoded include the FRUC mode, the merge mode, the affine mode (specifically, the affine merge mode), etc. Inter predictor 126 selects a mode for deriving an MV of the current block from the plurality of modes, and derives the MV of the current block using the selected mode.

[Motion Vector Derivation Flow]

FIG. 18 is a flow chart illustrating another example of derivation of motion vectors. The MV derivation modes which are inter prediction modes include a plurality of modes and are roughly divided into modes in which an MV difference is encoded and modes in which no motion vector difference is encoded. The modes in which no MV difference is encoded include the merge mode, the FRUC mode, the affine mode (specifically, the affine merge mode), etc. These modes are described in detail later. Simply, the merge mode is a mode for deriving an MV of a current block by selecting a motion vector from an encoded surrounding block, and the FRUC mode is a mode for deriving an MV of a current block by performing estimation between encoded regions. The affine mode is a mode for deriving, as an MV of a current block, a motion vector of each of a plurality of sub-blocks included in the current block, assuming affine transform.

More specifically, as illustrated when the inter prediction mode information indicates 0 (0 in Sf_1), inter predictor 126 derives a motion vector using the merge mode (Sf_2). When the inter prediction mode information indicates 1 (1 in Sf_1), inter predictor 126 derives a motion vector using the FRUC mode (Sf_3). When the inter prediction mode information indicates 2 (2 in Sf_1), inter predictor 126 derives a motion vector using the affine mode (specifically, the affine merge mode) (Sf_4). When the inter prediction mode information indicates 3 (3 in Sf_1), inter predictor 126 derives a motion vector using a mode in which an MV difference is encoded (for example, a normal inter mode (Sf_5).

[MV Derivation>Normal Inter Mode]

The normal inter mode is an inter prediction mode for deriving an MV of a current block based on a block similar to the image of the current block from a reference picture region specified by an MV candidate. In this normal inter mode, an MV difference is encoded.

FIG. 19 is a flow chart illustrating an example of inter prediction in normal inter mode.

First, inter predictor 126 obtains a plurality of MV candidates for a current block based on information such as MVs of a plurality of encoded blocks temporally or spatially surrounding the current block (Step Sg_1). In other words, inter predictor 126 generates an MV candidate list.

Next, inter predictor 126 extracts N (an integer of 2 or larger) MV candidates from the plurality of MV candidates obtained in Step Sg_1, as motion vector predictor candidates (also referred to as MV predictor candidates) according to a determined priority order (Step Sg_2). It is to be noted that the priority order may be determined in advance for each of the N MV candidates.

Next, inter predictor 126 selects one motion vector predictor candidate from the N motion vector predictor candidates, as the motion vector predictor (also referred to as an MV predictor) of the current block (Step Sg_3). At this time, inter predictor 126 encodes, in a stream, motion vector predictor selection information for identifying the selected motion vector predictor. It is to be noted that the stream is an encoded signal or an encoded bitstream as described above.

Next, inter predictor 126 derives an MV of a current block by referring to an encoded reference picture (Step Sg_4). At this time, inter predictor 126 further encodes, in the stream, the difference value between the derived MV and the motion vector predictor as an MV difference. It is to be noted that the encoded reference picture is a picture including a plurality of blocks which have been reconstructed after being encoded.

Lastly, inter predictor 126 generates a prediction image for the current block by performing motion compensation of the current block using the derived MV and the encoded reference picture (Step Sg_5). It is to be noted that the prediction image is an inter prediction signal as described above.

In addition, information indicating the inter prediction mode (normal inter mode in the above example) used to generate the prediction image is, for example, encoded as a prediction parameter.

It is to be noted that the MV candidate list may be also used as a list for use in another mode. In addition, the processes related to the MV candidate list may be applied to processes related to the list for use in another mode. The processes related to the MV candidate list include, for example, extraction or selection of an MV candidate from the MV candidate list, reordering of MV candidates, or deletion of an MV candidate.

[MV Derivation>Merge Mode]

The merge mode is an inter prediction mode for selecting an MV candidate from an MV candidate list as an MV of a current block, thereby deriving the MV.

FIG. 20 is a flow chart illustrating an example of inter prediction in merge mode.

First, inter predictor 126 obtains a plurality of MV candidates for a current block based on information such as MVs of a plurality of encoded blocks temporally or spatially surrounding the current block (Step Sh_1). In other words, inter predictor 126 generates an MV candidate list.

Next, inter predictor 126 selects one MV candidate from the plurality of MV candidates obtained in Step Sh_1, thereby deriving an MV of the current block (Step Sh_2). At this time, inter predictor 126 encodes, in a stream, MV selection information for identifying the selected MV candidate.

Lastly, inter predictor 126 generates a prediction image for the current block by performing motion compensation of the current block using the derived MV and the encoded reference picture (Step Sh_3).

In addition, information indicating the inter prediction mode (merge mode in the above example) used to generate the prediction image and included in the encoded signal is, for example, encoded as a prediction parameter.

FIG. 21 is a conceptual diagram for illustrating one example of a motion vector derivation process of a current picture in merge mode.

First, an MV candidate list in which MV predictor candidates are registered is generated. Examples of MV predictor candidates include: spatially neighboring MV predictors which are MVs of a plurality of encoded blocks located spatially surrounding a current block; temporally neighboring MV predictors which are MVs of surrounding blocks on which the position of a current block in an encoded reference picture is projected; combined MV predictors which are MVs generated by combining the MV value of a spatially neighboring MV predictor and the MV of a temporally neighboring MV predictor; and a zero MV predictor which is an MV having a zero value.

Next, one MV predictor is selected from a plurality of MV predictors registered in an MV predictor list, and the selected MV predictor is determined as the MV of a current block.

Furthermore, the variable length encoder describes and encodes, in a stream, merge_idx which is a signal indicating which MV predictor has been selected.

It is to be noted that the MV predictors registered in the MV predictor list described in FIG. 21 are examples. The number of MV predictors may be different from the number of MV predictors in the diagram, the MV predictor list may be configured in such a manner that some of the kinds of the MV predictors in the diagram may not be included, or that one or more MV predictors other than the kinds of MV predictors in the diagram are included.

A final MV may be determined by performing a decoder motion vector refinement process (DMVR) to be described later using the MV of the current block derived in merge mode.

It is to be noted that the MV predictor candidates are MV candidates described above, and the MV predictor list is the MV candidate list described above. It is to be noted that the MV candidate list may be referred to as a candidate list. In addition, merge_idx is MV selection information.

[MV Derivation>FRUC Mode]

Motion information may be derived at the decoder side without being signaled from the encoder side. It is to be noted that, as described above, the merge mode defined in the H.265/HEVC standard may be used. In addition, for example, motion information may be derived by performing motion estimation at the decoder side. In an embodiment, at the decoder side, motion estimation is performed without using any pixel value in a current block.

Here, a mode for performing motion estimation at the decoder side is described. The mode for performing motion estimation at the decoder side may be referred to as a pattern matched motion vector derivation (PMMVD) mode, or a frame rate up-conversion (FRUC) mode.

One example of a FRUC process in the form of a flow chart is illustrated in FIG. 22. First, a list of a plurality of candidates each having a motion vector (MV) predictor (that is, an MV candidate list that may be also used as a merge list) is generated by referring to a motion vector in an encoded block which spatially or temporally neighbors a current block (Step Si_1). Next, a best MV candidate is selected from the plurality of MV candidates registered in the MV candidate list (Step Si_2). For example, the evaluation values of the respective MV candidates included in the MV candidate list are calculated, and one MV candidate is selected based on the evaluation values. Based on the selected motion vector candidates, a motion vector for the current block is then derived (Step Si_4). More specifically, for example, the selected motion vector candidate (best MV candidate) is derived directly as the motion vector for the current block. In addition, for example, the motion vector for the current block may be derived using pattern matching in a surrounding region of a position in a reference picture where the position in the reference picture corresponds to the selected motion vector candidate. In other words, estimation using the pattern matching and the evaluation values may be performed in the surrounding region of the best MV candidate, and when there is an MV that yields a better evaluation value, the best MV candidate may be updated to the MV that yields the better evaluation value, and the updated MV may be determined as the final MV for the current block. A configuration in which no such a process for updating the best MV candidate to the MV having a better evaluation value is performed is also possible.

Lastly, inter predictor 126 generates a prediction image for the current block by performing motion compensation of the current block using the derived MV and the encoded reference picture (Step Si_5).

A similar process may be performed in units of a sub-block.

Evaluation values may be calculated according to various kinds of methods. For example, a comparison is made between a reconstructed image in a region in a reference picture corresponding to a motion vector and a reconstructed image in a determined region (the region may be, for example, a region in another reference picture or a region in a neighboring block of a current picture, as indicated below). The determined region may be predetermined.

The difference between the pixel values of the two reconstructed images may be used for an evaluation value of the motion vectors. It is to be noted that an evaluation value may be calculated using information other than the value of the difference.

Next, an example of pattern matching is described in detail. First, one MV candidate included in an MV candidate list (for example, a merge list) is selected as a start point of estimation by the pattern matching. For example, as the pattern matching, either a first pattern matching or a second pattern matching may be used. The first pattern matching and the second pattern matching are also referred to as bilateral matching and template matching, respectively.

[MV Derivation>FRUC>Bilateral Matching]

In the first pattern matching, pattern matching is performed between two blocks along a motion trajectory of a current block which are two blocks in different two reference pictures. Accordingly, in the first pattern matching, a region in another reference picture along the motion trajectory of the current block is used as a determined region for calculating the evaluation value of the above-described candidate. The determined region may be predetermined.

FIG. 23 is a conceptual diagram for illustrating one example of the first pattern matching (bilateral matching) between the two blocks in the two reference pictures along the motion trajectory. As illustrated in FIG. 23, in the first pattern matching, two motion vectors (MV0, MV1) are derived by estimating a pair which best matches among pairs in the two blocks in the two different reference pictures (Ref0, Ref1) which are the two blocks along the motion trajectory of the current block (Cur block). More specifically, a difference between the reconstructed image at a specified location in the first encoded reference picture (Ref0) specified by an MV candidate and the reconstructed image at a specified location in the second encoded reference picture (Ref1) specified by a symmetrical MV obtained by scaling the MV candidate at a display time interval is derived for the current block, and an evaluation value is calculated using the value of the obtained difference. It is possible to select, as the final MV, the MV candidate which yields the best evaluation value among the plurality of MV candidates, and which is likely to produce good results.

In the assumption of a continuous motion trajectory, the motion vectors (MV0, MV1) specifying the two reference blocks are proportional to temporal distances (TD0, TD1) between the current picture (Cur Pic) and the two reference pictures (Ref0, Ref1). For example, when the current picture is temporally located between the two reference pictures and the temporal distances from the current picture to the respective two reference pictures are equal to each other, mirror-symmetrical bi-directional motion vectors are derived in the first pattern matching.

[MV Derivation>FRUC>Template Matching]

In the second pattern matching (template matching), pattern matching is performed between a block in a reference picture and a template in the current picture (the template is a block neighboring the current block in the current picture (the neighboring block is, for example, an upper and/or left neighboring block(s))). Accordingly, in the second pattern matching, the block neighboring the current block in the current picture is used as the determined region for calculating the evaluation value of the above-described candidate.

FIG. 24 is a conceptual diagram for illustrating one example of pattern matching (template matching) between a template in a current picture and a block in a reference picture. As illustrated in FIG. 24, in the second pattern matching, the motion vector of the current block (Cur block) is derived by estimating, in the reference picture (Ref0), the block which best matches the block neighboring the current block in the current picture (Cur Pic). More specifically, it is possible that the difference between a reconstructed image in an encoded region which neighbors both left and above or either left or above and a reconstructed image which is in a corresponding region in the encoded reference picture (Ref0) and is specified by an MV candidate is derived, an evaluation value is calculated using the value of the obtained difference, and the MV candidate which yields the best evaluation value among a plurality of MV candidates is selected as the best MV candidate.

Such information indicating whether to apply the FRUC mode (referred to as, for example, a FRUC flag) may be signaled at the CU level. In addition, when the FRUC mode is applied (for example, when a FRUC flag is true), information indicating an applicable pattern matching method (either the first pattern matching or the second pattern matching) may be signaled at the CU level. It is to be noted that the signaling of such information does not necessarily need to be performed at the CU level, and may be performed at another level (for example, at the sequence level, picture level, slice level, tile level, CTU level, or sub-block level).

[MV Derivation>Affine Mode]

Next, the affine mode for deriving a motion vector in units of a sub-block based on motion vectors of a plurality of neighboring blocks is described. This mode is also referred to as an affine motion compensation prediction mode.

FIG. 25A is a conceptual diagram for illustrating one example of deriving a motion vector of each sub-block based on motion vectors of a plurality of neighboring blocks. In FIG. 25A, the current block includes sixteen 4×4 sub-blocks. Here, motion vector V₀ at an upper-left corner control point in the current block is derived based on a motion vector of a neighboring block, and likewise, motion vector V₁ at an upper-right corner control point in the current block is derived based on a motion vector of a neighboring sub-block. Two motion vectors v₀ and v₁ may be projected according to an expression (1A) indicated below, and motion vectors (v_(x), v_(y)) for the respective sub-blocks in the current block may be derived.

[Math.  1] $\begin{matrix} \left\{ \begin{matrix} {v_{x} = {{\frac{\left( {v_{1x} - v_{0x}} \right)}{w}x} - {\frac{\left( {v_{1y} - v_{0y}} \right)}{w}y} + v_{0x}}} \\ {v_{y} = {{\frac{\left( {v_{1y} - v_{0y}} \right)}{w}x} - {\frac{\left( {v_{1x} - v_{0x}} \right)}{w}y} + v_{0y}}} \end{matrix} \right. & \left( {1A} \right) \end{matrix}$

Here, x and y indicate the horizontal position and the vertical position of the sub-block, respectively, and w indicates a determined weighting coefficient. The determined weighting coefficient may be predetermined.

Such information indicating the affine mode (for example, referred to as an affine flag) may be signaled at the CU level. It is to be noted that the signaling of the information indicating the affine mode does not necessarily need to be performed at the CU level, and may be performed at another level (for example, at the sequence level, picture level, slice level, tile level, CTU level, or sub-block level).

In addition, the affine mode may include several modes for different methods for deriving motion vectors at the upper-left and upper-right corner control points. For example, the affine mode include two modes which are the affine inter mode (also referred to as an affine normal inter mode) and the affine merge mode.

[MV Derivation>Affine Mode]

FIG. 25B is a conceptual diagram for illustrating one example of deriving a motion vector of each sub-block in affine mode in which three control points are used. In FIG. 25B, the current block includes sixteen 4×4 blocks. Here, motion vector V₀ at the upper-left corner control point for the current block is derived based on a motion vector of a neighboring block, and likewise, motion vector V₁ at the upper-right corner control point for the current block is derived based on a motion vector of a neighboring block, and motion vector V₂ at the lower-left corner control point for the current block is derived based on a motion vector of a neighboring block. Three motion vectors v₀, v₁, and v₂ may be projected according to an expression (1B) indicated below, and motion vectors (v_(x), v_(y)) for the respective sub-blocks in the current block may be derived.

[Math.  2] $\begin{matrix} \left\{ \begin{matrix} {v_{x} = {{\frac{\left( {v_{1x} - v_{0x}} \right)}{w}x} - {\frac{\left( {v_{2x} - v_{0x}} \right)}{h}y} + v_{0x}}} \\ {v_{y} = {{\frac{\left( {v_{1y} - v_{0y}} \right)}{w}x} - {\frac{\left( {v_{2y} - v_{0y}} \right)}{h}y} + v_{0y}}} \end{matrix} \right. & \left( {1B} \right) \end{matrix}$

Here, x and y indicate the horizontal position and the vertical position of the center of the sub-block, respectively, w indicates the width of the current block, and h indicates the height of the current block.

Affine modes in which different numbers of control points (for example, two and three control points) are used may be switched and signaled at the CU level. It is to be noted that information indicating the number of control points in affine mode used at the CU level may be signaled at another level (for example, the sequence level, picture level, slice level, tile level, CTU level, or sub-block level).

In addition, such an affine mode in which three control points are used may include different methods for deriving motion vectors at the upper-left, upper-right, and lower-left corner control points. For example, the affine modes include two modes which are the affine inter mode (also referred to as the affine normal inter mode) and the affine merge mode.

[MV Derivation>Affine Merge Mode]

FIG. 26A, FIG. 26B, and FIG. 26C are conceptual diagrams for illustrating the affine merge mode.

As illustrated in FIG. 26A, in the affine merge mode, for example, motion vector predictors at respective control points of a current block are calculated based on a plurality of motion vectors corresponding to blocks encoded according to the affine mode among encoded block A (left), block B (upper), block C (upper-right), block D (lower-left), and block E (upper-left) which neighbor the current block. More specifically, encoded block A (left), block B (upper), block C (upper-right), block D (lower-left), and block E (upper-left) are checked in the listed order, and the first effective block encoded according to the affine mode is identified. Motion vector predictors at the control points of the current block are calculated based on a plurality of motion vectors corresponding to the identified block.

For example, as illustrated in FIG. 26B, when block A which neighbors to the left of the current block has been encoded according to an affine mode in which two control points are used, motion vectors v₃ and v₄ projected at the upper-left corner position and the upper-right corner position of the encoded block including block A are derived. Motion vector predictor v₀ at the upper-left corner control point of the current block and motion vector predictor v₁ at the upper-right corner control point of the current block are then calculated from derived motion vectors v₃ and v₄.

For example, as illustrated in FIG. 26C, when block A which neighbors to the left of the current block has been encoded according to an affine mode in which three control points are used, motion vectors v₃, v₄, and v₅ projected at the upper-left corner position, the upper-right corner position, and the lower-left corner position of the encoded block including block A are derived. Motion vector predictor v₀ at the upper-left corner control point of the current block, motion vector predictor v₁ at the upper-right corner control point of the current block, and motion vector predictor v₂ at the lower-left corner control point of the current block are then calculated from derived motion vectors v₃, v₄, and v₅.

It is to be noted that this method for deriving motion vector predictors may be used to derive motion vector predictors of the respective control points of the current block in Step Sj_1 in FIG. 29 described later.

FIG. 27 is a flow chart illustrating one example of the affine merge mode.

In affine merge mode as illustrated, first, inter predictor 126 derives MV predictors of respective control points of a current block (Step Sk_1). The control points are an upper-left corner point of the current block and an upper-right corner point of the current block as illustrated in FIG. 25A, or an upper-left corner point of the current block, an upper-right corner point of the current block, and a lower-left corner point of the current block as illustrated in FIG. 25B.

In other words, as illustrated in FIG. 26A, inter predictor 126 checks encoded block A (left), block B (upper), block C (upper-right), block D (lower-left), and block E (upper-left) in the listed order, and identifies the first effective block encoded according to the affine mode.

When block A is identified and block A has two control points, as illustrated in FIG. 26B, inter predictor 126 calculates motion vector v₀ at the upper-left corner control point of the current block and motion vector v₁ at the upper-right corner control point of the current block from motion vectors v₃ and v₄ at the upper-left corner and the upper-right corner of the encoded block including block A. For example, inter predictor 126 calculates motion vector v₀ at the upper-left corner control point of the current block and motion vector v₁ at the upper-right corner control point of the current block by projecting motion vectors v₃ and v₄ at the upper-left corner and the upper-right corner of the encoded block onto the current block.

Alternatively, when block A is identified and block A has three control points, as illustrated in FIG. 26C, inter predictor 126 calculates motion vector v₀ at the upper-left corner control point of the current block, motion vector v₁ at the upper-right corner control point of the current block, and motion vector v₂ at the lower-left corner control point of the current block from motion vectors v₃, v₄, and v₅ at the upper-left corner, the upper-right corner, and the lower-left corner of the encoded block including block A. For example, inter predictor 126 calculates motion vector v₀ at the upper-left corner control point of the current block, motion vector v₁ at the upper-right corner control point of the current block, and motion vector v₂ at the lower-left corner control point of the current block by projecting motion vectors v₃, v₄, and v₅ at the upper-left corner, the upper-right corner, and the lower-left corner of the encoded block onto the current block.

Next, inter predictor 126 performs motion compensation of each of a plurality of sub-blocks included in the current block. In other words, inter predictor 126 calculates, for each of the plurality of sub-blocks, a motion vector of the sub-block as an affine MV, by using either (i) two motion vector predictors v₀ and v₁ and the expression (1A) described above or (ii) three motion vector predictors v₀, v₁, and v₂ and the expression (1B) described above (Step Sk_2). Inter predictor 126 then performs motion compensation of the sub-blocks using these affine MVs and encoded reference pictures (Step Sk_3). As a result, motion compensation of the current block is performed to generate a prediction image of the current block.

[MV Derivation>Affine Inter Mode]

FIG. 28A is a conceptual diagram for illustrating an affine inter mode in which two control points are used.

In the affine inter mode, as illustrated in FIG. 28A, a motion vector selected from motion vectors of encoded block A, block B, and block C which neighbor the current block is used as motion vector predictor v₀ at the upper-left corner control point of the current block. Likewise, a motion vector selected from motion vectors of encoded block D and block E which neighbor the current block is used as motion vector predictor v₁ at the upper-right corner control point of the current block.

FIG. 28B is a conceptual diagram for illustrating an affine inter mode in which three control points are used.

In the affine inter mode, as illustrated in FIG. 28B, a motion vector selected from motion vectors of encoded block A, block B, and block C which neighbor the current block is used as motion vector predictor v₀ at the upper-left corner control point of the current block. Likewise, a motion vector selected from motion vectors of encoded block D and block E which neighbor the current block is used as motion vector predictor v₁ at the upper-right corner control point of the current block. Furthermore, a motion vector selected from motion vectors of encoded block F and block G which neighbor the current block is used as motion vector predictor v₂ at the lower-left corner control point of the current block.

FIG. 29 is a flow chart illustrating one example of an affine inter mode.

In the affine inter mode as illustrated, first, inter predictor 126 derives MV predictors (v₀, v₁) or (v₀, v₁, v₂) of respective two or three control points of a current block (Step Sj_1). The control points are an upper-left corner point of the current block and an upper-right corner point of the current block as illustrated in FIG. 25A, or an upper-left corner point of the current block, an upper-right corner point of the current block, and a lower-left corner point of the current block as illustrated in FIG. 25B.

In other words, inter predictor 126 derives the motion vector predictors (v₀, v₁) or (v₀, v₁, v₂) of respective two or three control points of the current block by selecting motion vectors of any of the blocks among encoded blocks in the vicinity of the respective control points of the current block illustrated in either FIG. 28A or FIG. 28B. At this time, inter predictor 126 encodes, in a stream, motion vector predictor selection information for identifying the selected two motion vectors.

For example, inter predictor 126 may determine, using a cost evaluation or the like, the block from which a motion vector as a motion vector predictor at a control point is selected from among encoded blocks neighboring the current block, and may describe, in a bitstream, a flag indicating which motion vector predictor has been selected.

Next, inter predictor 126 performs motion estimation (Step Sj_3 and Sj_4) while updating a motion vector predictor selected or derived in Step Sj_1 (Step Sj_2). In other words, inter predictor 126 calculates, as an affine MV, a motion vector of each of sub-blocks which corresponds to an updated motion vector predictor, using either the expression (1A) or expression (1B) described above (Step Sj_3). Inter predictor 126 then performs motion compensation of the sub-blocks using these affine MVs and encoded reference pictures (Step Sj_4). As a result, for example, inter predictor 126 determines the motion vector predictor which yields the smallest cost as the motion vector at a control point in a motion estimation loop (Step Sj_5). At this time, inter predictor 126 further encodes, in the stream, the difference value between the determined MV and the motion vector predictor as an MV difference.

Lastly, inter predictor 126 generates a prediction image for the current block by performing motion compensation of the current block using the determined MV and the encoded reference picture (Step Sj_6).

[MV Derivation>Affine Inter Mode]

When affine modes in which different numbers of control points (for example, two and three control points) are used may be switched and signaled at the CU level, the number of control points in an encoded block and the number of control points in a current block may be different from each other. FIG. 30A and FIG. 30B are conceptual diagrams for illustrating methods for deriving motion vector predictors at control points when the number of control points in an encoded block and the number of control points in a current block are different from each other.

For example, as illustrated in FIG. 30A, when a current block has three control points at the upper-left corner, the upper-right corner, and the lower-left corner, and block A which neighbors to the left of the current block has been encoded according to an affine mode in which two control points are used, motion vectors v₃ and v₄ projected at the upper-left corner position and the upper-right corner position in the encoded block including block A are derived. Motion vector predictor v₀ at the upper-left corner control point of the current block and motion vector predictor v₁ at the upper-right corner control point of the current block are then calculated from derived motion vectors v₃ and v₄. Furthermore, motion vector predictor v₂ at the lower-left corner control point is calculated from derived motion vectors v₀ and v₁.

For example, as illustrated in FIG. 30B, when a current block has two control points at the upper-left corner and the upper-right corner, and block A which neighbors to the left of the current block has been encoded according to the affine mode in which three control points are used, motion vectors v₃, v₄, and v₅ projected at the upper-left corner position, the upper-right corner position, and the lower-left corner position in the encoded block including block A are derived. Motion vector predictor v₀ at the upper-left corner control point of the current block and motion vector predictor v₁ at the upper-right corner control point of the current block are then calculated from derived motion vectors v₃, v₄, and v₅.

It is to be noted that this method for deriving motion vector predictors may be used to derive motion vector predictors of the respective control points of the current block in Step Sj_1 in FIG. 29.

[MV Derivation>DMVR]

FIG. 31A is a flow chart illustrating a relationship between the merge mode and DMVR.

Inter predictor 126 derives a motion vector of a current block according to the merge mode (Step Sl_1). Next, inter predictor 126 determines whether to perform estimation of a motion vector, that is, motion estimation (Step Sl_2). Here, when determining not to perform motion estimation (No in Step Sl_2), inter predictor 126 determines the motion vector derived in Step Sl_1 as the final motion vector for the current block (Step Sl_4). In other words, in this case, the motion vector of the current block is determined according to the merge mode.

When determining to perform motion estimation in Step Sl_1 (Yes in Step Sl_2), inter predictor 126 derives the final motion vector for the current block by estimating a surrounding region of the reference picture specified by the motion vector derived in Step Sl_1 (Step Sl_3). In other words, in this case, the motion vector of the current block is determined according to the DMVR.

FIG. 31B is a conceptual diagram for illustrating one example of a DMVR process for determining an MV.

First, (for example, in merge mode) the best Motion Vector Predictor (MVP) which has been set to the current block is determined to be an MV candidate. A reference pixel is identified from a first reference picture (L0) which is an encoded picture in the L0 direction according to an MV candidate (L0). Likewise, a reference pixel is identified from a second reference picture (L1) which is an encoded picture in the L1 direction according to an MV candidate (L1). A template is generated by calculating an average of these reference pixels.

Next, each of the surrounding regions of MV candidates of the first reference picture (L0) and the second reference picture (L1) are estimated, and the MV which yields the smallest cost is determined to be the final MV. It is to be noted that the cost value may be calculated, for example, using a difference value between each of the pixel values in the template and a corresponding one of the pixel values in the estimation region, the values of MV candidates, etc. It is to be noted that the processes, configurations, and operations described here typically are basically common between the encoder and a decoder to be described later.

Exactly the same example processes described here do not always need to be performed. Any process for enabling derivation of the final MV by estimation in surrounding regions of MV candidates may be used.

[Motion Compensation>BIO/OBMC]

Motion compensation involves a mode for generating a prediction image, and correcting the prediction image. The mode is, for example, BIO and OBMC to be described later.

FIG. 32 is a flow chart illustrating one example of generation of a prediction image.

Inter predictor 126 generates a prediction image (Step Sm_1), and corrects the prediction image, for example, according to any of the modes described above (Step Sm_2).

FIG. 33 is a flow chart illustrating another example of generation of a prediction image.

Inter predictor 126 determines a motion vector of a current block (Step Sn_1). Next, inter predictor 126 generates a prediction image (Step Sn_2), and determines whether to perform a correction process (Step Sn_3). Here, when determining to perform a correction process (Yes in Step Sn_3), inter predictor 126 generates the final prediction image by correcting the prediction image (Step Sn_4). When determining not to perform a correction process (No in Step Sn_3), inter predictor 126 outputs the prediction image as the final prediction image without correcting the prediction image (Step Sn_5).

In addition, motion compensation involves a mode for correcting a luminance of a prediction image when generating the prediction image. The mode is, for example, LIC to be described later.

FIG. 34 is a flow chart illustrating another example of generation of a prediction image.

Inter predictor 126 derives a motion vector of a current block (Step So_1). Next, inter predictor 126 determines whether to perform a luminance correction process (Step So_2). Here, when determining to perform a luminance correction process (Yes in Step So_2), inter predictor 126 generates the prediction image while performing a luminance correction process (Step So_3).

In other words, the prediction image is generated using LIC. When determining not to perform a luminance correction process (No in Step So_2), inter predictor 126 generates a prediction image by performing normal motion compensation without performing a luminance correction process (Step So_4).

[Motion Compensation>OBMC]

It is to be noted that an inter prediction signal may be generated using motion information for a neighboring block in addition to motion information for the current block obtained from motion estimation. More specifically, the inter prediction signal may be generated in units of a sub-block in the current block by performing a weighted addition of a prediction signal based on motion information obtained from motion estimation (in the reference picture) and a prediction signal based on motion information for a neighboring block (in the current picture). Such inter prediction (motion compensation) is also referred to as overlapped block motion compensation (OBMC).

In OBMC mode, information indicating a sub-block size for OBMC (referred to as, for example, an OBMC block size) may be signaled at the sequence level. Moreover, information indicating whether to apply the OBMC mode (referred to as, for example, an OBMC flag) may be signaled at the CU level. It is to be noted that the signaling of such information does not necessarily need to be performed at the sequence level and CU level, and may be performed at another level (for example, at the picture level, slice level, tile level, CTU level, or sub-block level).

Examples of the OBMC mode will be described in further detail. FIGS. 35 and 36 are a flow chart and a conceptual diagram for illustrating an outline of a prediction image correction process performed by an OBMC process.

First, as illustrated in FIG. 36, a prediction image (Pred) is obtained through normal motion compensation using a motion vector (MV) assigned to the processing target (current) block. In FIG. 36, the arrow “MV” points a reference picture, and indicates what the current block of the current picture refers to in order to obtain a prediction image.

Next, a prediction image (Pred_L) is obtained by applying a motion vector (MV_L) which has been already derived for the encoded block neighboring to the left of the current block to the current block (re-using the motion vector for the current block). The motion vector (MV_L) is indicated by an arrow “MV_L” indicating a reference picture from a current block. A first correction of a prediction image is performed by overlapping two prediction images Pred and Pred_L. This provides an effect of blending the boundary between neighboring blocks.

Likewise, a prediction image (Pred_U) is obtained by applying a motion vector (MV_U) which has been already derived for the encoded block neighboring above the current block to the current block (re-using the motion vector for the current block). The motion vector (MV_U) is indicated by an arrow “MV_U” indicating a reference picture from a current block. A second correction of a prediction image is performed by overlapping the prediction image Pred_U to the prediction images (for example, Pred and Pred_L) on which the first correction has been performed. This provides an effect of blending the boundary between neighboring blocks. The prediction image obtained by the second correction is the one in which the boundary between the neighboring blocks has been blended (smoothed), and thus is the final prediction image of the current block.

Although the above example is a two-path correction method using left and upper neighboring blocks, it is to be noted that the correction method may be three- or more-path correction method using also the right neighboring block and/or the lower neighboring block.

It is to be noted that the region in which such overlapping is performed may be only part of a region near a block boundary instead of the pixel region of the entire block.

It is to be noted that the prediction image correction process according to OBMC for obtaining one prediction image Pred from one reference picture by overlapping additional prediction image Pred_L and Pred_U have been described above. However, when a prediction image is corrected based on a plurality of reference images, a similar process may be applied to each of the plurality of reference pictures. In such a case, after corrected prediction images are obtained from the respective reference pictures by performing OBMC image correction based on the plurality of reference pictures, the obtained corrected prediction images are further overlapped to obtain the final prediction image.

It is to be noted that, in OBMC, the unit of a current block may be the unit of a prediction block or the unit of a sub-block obtained by further splitting the prediction block.

One example of a method for determining whether to apply an OBMC process is a method for using an obmc_flag which is a signal indicating whether to apply an OBMC process. As one specific example, an encoder determines whether the current block belongs to a region having complicated motion. The encoder sets the obmc_flag to a value of “1” when the block belongs to a region having complicated motion and applies an OBMC process when encoding, and sets the obmc_flag to a value of “0” when the block does not belong to a region having complicated motion and encodes the block without applying an OBMC process. The decoder switches between application and non-application of an OBMC process by decoding the obmc_flag written in the stream (for example, a compressed sequence) and decoding the block by switching between the application and non-application of the OBMC process in accordance with the flag value.

Inter predictor 126 generates one rectangular prediction image for a rectangular current block in the above example. However, inter predictor 126 may generate a plurality of prediction images each having a shape different from a rectangle for the rectangular current block, and may combine the plurality of prediction images to generate the final rectangular prediction image. The shape different from a rectangle may be, for example, a triangle.

FIG. 37 is a conceptual diagram for illustrating generation of two triangular prediction images.

Inter predictor 126 generates a triangular prediction image by performing motion compensation of a first partition having a triangular shape in a current block by using a first MV of the first partition, to generate a triangular prediction image. Likewise, inter predictor 126 generates a triangular prediction image by performing motion compensation of a second partition having a triangular shape in a current block by using a second MV of the second partition, to generate a triangular prediction image. Inter predictor 126 then generates a prediction image having the same rectangular shape as the rectangular shape of the current block by combining these prediction images.

It is to be noted that, although the first partition and the second partition are triangles in the example illustrated in FIG. 37, the first partition and the second partition may be trapezoids, or other shapes different from each other. Furthermore, although the current block includes two partitions in the example illustrated in FIG. 37, the current block may include three or more partitions.

In addition, the first partition and the second partition may overlap with each other. In other words, the first partition and the second partition may include the same pixel region. In this case, a prediction image for a current block may be generated using a prediction image in the first partition and a prediction image in the second partition.

In addition, although an example in which a prediction image is generated for each of two partitions using inter prediction, a prediction image may be generated for at least one partition using intra prediction.

[Motion Compensation>BIO]

Next, a method for deriving a motion vector is described. First, a mode for deriving a motion vector based on a model assuming uniform linear motion will be described. This mode is also referred to as a bi-directional optical flow (BIO) mode.

FIG. 38 is a conceptual diagram for illustrating a model assuming uniform linear motion. In FIG. 38, (vx, vy) indicates a velocity vector, and τ0 and τ1 indicate temporal distances between a current picture (Cur Pic) and two reference pictures (Ref0, Ref1). (MVx0, MVy0) indicate motion vectors corresponding to reference picture Ref0, and (MVx1, MVy1) indicate motion vectors corresponding to reference picture Ref1.

Here, under the assumption of uniform linear motion exhibited by velocity vectors (v_(x), v_(y)), (MVx₀, MVy₀) and (MVx₁, MVy₁) are represented as (v_(x)τ₀, v_(y)τ₀) and (−v_(x)τ₁, −v_(y)τ₁), respectively, and the following optical flow equation (2) may be employed.

[MATH. 3]

∂I ^((k)) /∂t+v _(x) ∂I ^((k)) /∂x+v _(y) ∂I ^((k)) /∂y=0.  (2)

Here, I(k) indicates a motion-compensated luma value of reference picture k (k=0, 1). This optical flow equation shows that the sum of (i) the time derivative of the luma value, (ii) the product of the horizontal velocity and the horizontal component of the spatial gradient of a reference image, and (iii) the product of the vertical velocity and the vertical component of the spatial gradient of a reference image is equal to zero. A motion vector of each block obtained from, for example, a merge list may be corrected in units of a pixel, based on a combination of the optical flow equation and Hermite interpolation.

It is to be noted that a motion vector may be derived on the decoder side using a method other than deriving a motion vector based on a model assuming uniform linear motion. For example, a motion vector may be derived in units of a sub-block based on motion vectors of neighboring blocks.

[Motion Compensation>LIC]

Next, an example of a mode in which a prediction image (prediction) is generated by using a local illumination compensation (LIC) process will be described.

FIG. 39 is a conceptual diagram for illustrating one example of a prediction image generation method using a luminance correction process performed by a LIC process.

First, an MV is derived from an encoded reference picture, and a reference image corresponding to the current block is obtained.

Next, information indicating how the luma value changed between the reference picture and the current picture is extracted for the current block. This extraction is performed based on the luma pixel values for the encoded left neighboring reference region (surrounding reference region) and the encoded upper neighboring reference region (surrounding reference region), and the luma pixel value at the corresponding position in the reference picture specified by the derived MV. A luminance correction parameter is calculated by using the information indicating how the luma value changed.

The prediction image for the current block is generated by performing a luminance correction process in which the luminance correction parameter is applied to the reference image in the reference picture specified by the MV.

It is to be noted that the shape of the surrounding reference region illustrated in FIG. 39 is just one example; the surrounding reference region may have a different shape.

Moreover, although the process in which a prediction image is generated from a single reference picture has been described here, cases in which a prediction image is generated from a plurality of reference pictures can be described in the same manner. The prediction image may be generated after performing a luminance correction process of the reference images obtained from the reference pictures in the same manner as described above.

One example of a method for determining whether to apply a LIC process is a method for using a lic_flag which is a signal indicating whether to apply the LIC process. As one specific example, the encoder determines whether the current block belongs to a region having a luminance change. The encoder sets the lic_flag to a value of “1” when the block belongs to a region having a luminance change and applies a LIC process when encoding, and sets the lic_flag to a value of “0” when the block does not belong to a region having a luminance change and encodes the current block without applying a LIC process. The decoder may decode the lic_flag written in the stream and decode the current block by switching between application and non-application of a LIC process in accordance with the flag value.

One example of a different method of determining whether to apply a LIC process is a determining method in accordance with whether a LIC process was applied to a surrounding block. In one specific example, when the merge mode is used on the current block, whether a LIC process was applied in the encoding of the surrounding encoded block selected upon deriving the MV in the merge mode process is determined. According to the result, encoding is performed by switching between application and non-application of a LIC process. It is to be noted that, also in this example, the same processes are applied in processes at the decoder side.

An embodiment of the luminance correction (LIC) process described with reference to FIG. 39 is described in detail below.

First, inter predictor 126 derives a motion vector for obtaining a reference image corresponding to a current block to be encoded from a reference picture which is an encoded picture.

Next, inter predictor 126 extracts information indicating how the luma value of the reference picture has been changed to the luma value of the current picture, using the luma pixel value of an encoded surrounding reference region which neighbors to the left of or above the current block and the luma value in the corresponding position in the reference picture specified by a motion vector, and calculates a luminance correction parameter. For example, it is assumed that the luma pixel value of a given pixel in the surrounding reference region in the current picture is p0, and that the luma pixel value of the pixel corresponding to the given pixel in the surrounding reference region in the reference picture is p1. Inter predictor 126 calculates coefficients A and B for optimizing A×p1+B=p0 as the luminance correction parameter for a plurality of pixels in the surrounding reference region.

Next, inter predictor 126 performs a luminance correction process using the luminance correction parameter for the reference image in the reference picture specified by the motion vector, to generate a prediction image for the current block. For example, it is assumed that the luma pixel value in the reference image is p2, and that the luminance-corrected luma pixel value of the prediction image is p3. Inter predictor 126 generates the prediction image after being subjected to the luminance correction process by calculating A×p2+B=p3 for each of the pixels in the reference image.

It is to be noted that the shape of the surrounding reference region illustrated in FIG. 39 is one example; a different shape other than the shape of the surrounding reference region may be used. In addition, part of the surrounding reference region illustrated in FIG. 39 may be used. For example, a region having a determined number of pixels extracted from each of an upper neighboring pixel and a left neighboring pixel may be used as a surrounding reference region. The determined number of pixels may be predetermined.

In addition, the surrounding reference region is not limited to a region which neighbors the current block, and may be a region which does not neighbor the current block. In the example illustrated in FIG. 39, the surrounding reference region in the reference picture is a region specified by a motion vector in a current picture, from a surrounding reference region in the current picture. However, a region specified by another motion vector is also possible. For example, the other motion vector may be a motion vector in a surrounding reference region in the current picture.

Although operations performed by encoder 100 have been described here, it is to be noted that decoder 200 typically performs similar operations.

It is to be noted that the LIC process may be applied not only to the luma but also to chroma. At this time, a correction parameter may be derived individually for each of Y, Cb, and Cr, or a common correction parameter may be used for any of Y, Cb, and Cr.

In addition, the LIC process may be applied in units of a sub-block. For example, a correction parameter may be derived using a surrounding reference region in a current sub-block and a surrounding reference region in a reference sub-block in a reference picture specified by an MV of the current sub-block.

[Prediction Controller]

Inter predictor 128 selects one of an intra prediction signal (a signal output from intra predictor 124) and an inter prediction signal (a signal output from inter predictor 126), and outputs the selected signal to subtractor 104 and adder 116 as a prediction signal.

As illustrated in FIG. 1, in various kinds of encoder examples, prediction controller 128 may output a prediction parameter which is input to entropy encoder 110. Entropy encoder 110 may generate an encoded bitstream (or a sequence), based on the prediction parameter which is input from prediction controller 128 and quantized coefficients which are input from quantizer 108. The prediction parameter may be used in a decoder. The decoder may receive and decode the encoded bitstream, and perform the same processes as the prediction processes performed by intra predictor 124, inter predictor 126, and prediction controller 128. The prediction parameter may include (i) a selection prediction signal (for example, a motion vector, a prediction type, or a prediction mode used by intra predictor 124 or inter predictor 126), or (ii) an optional index, a flag, or a value which is based on a prediction process performed in each of intra predictor 124, inter predictor 126, and prediction controller 128, or which indicates the prediction process.

Mounting Example of Encoder

FIG. 40 is a block diagram illustrating a mounting example of encoder 100. Encoder 100 includes processor a1 and memory a2. For example, the plurality of constituent elements of encoder 100 illustrated in FIG. 1 are mounted on processor a1 and memory a2 illustrated in FIG. 40.

Processor a1 is circuitry which performs information processing and is accessible to memory a2. For example, processor a1 is dedicated or general electronic circuitry which encodes a video. Processor a1 may be a processor such as a CPU. In addition, processor a1 may be an aggregate of a plurality of electronic circuits. In addition, for example, processor a1 may take the roles of two or more constituent elements out of the plurality of constituent elements of encoder 100 illustrated in FIG. 1, etc.

Memory a2 is dedicated or general memory for storing information that is used by processor a1 to encode a video. Memory a2 may be electronic circuitry, and may be connected to processor a1. In addition, memory a2 may be included in processor a1. In addition, memory a2 may be an aggregate of a plurality of electronic circuits. In addition, memory a2 may be a magnetic disc, an optical disc, or the like, or may be represented as a storage, a recording medium, or the like. In addition, memory a2 may be non-volatile memory, or volatile memory.

For example, memory a2 may store a video to be encoded or a bitstream corresponding to an encoded video. In addition, memory a2 may store a program for causing processor a1 to encode a video.

In addition, for example, memory a2 may take the roles of two or more constituent elements for storing information out of the plurality of constituent elements of encoder 100 illustrated in FIG. 1, etc. For example, memory a2 may take the roles of block memory 118 and frame memory 122 illustrated in FIG. 1. More specifically, memory a2 may store a reconstructed block, a reconstructed picture, etc.

It is to be noted that, in encoder 100, all of the plurality of constituent elements indicated in FIG. 1, etc. may not be implemented, and all the processes described above may not be performed. Part of the constituent elements indicated in FIG. 1, etc. may be included in another device, or part of the processes described above may be performed by another device.

[Decoder]

Next, a decoder capable of decoding an encoded signal (encoded bitstream) output, for example, from encoder 100 described above will be described. FIG. 41 is a block diagram illustrating a configuration of decoder 200 according to an embodiment. Decoder 200 is a video decoder which decodes a video in units of a block.

As illustrated in FIG. 41, decoder 200 includes entropy decoder 202, inverse quantizer 204, inverse transformer 206, adder 208, block memory 210, loop filter 212, frame memory 214, intra predictor 216, inter predictor 218, and prediction controller 220.

Decoder 200 is implemented as, for example, a generic processor and memory. In this case, when a software program stored in the memory is executed by the processor, the processor functions as entropy decoder 202, inverse quantizer 204, inverse transformer 206, adder 208, loop filter 212, intra predictor 216, inter predictor 218, and prediction controller 220. Alternatively, decoder 200 may be implemented as one or more dedicated electronic circuits corresponding to entropy decoder 202, inverse quantizer 204, inverse transformer 206, adder 208, loop filter 212, intra predictor 216, inter predictor 218, and prediction controller 220.

Hereinafter, an overall flow of processes performed by decoder 200 is described, and then each of constituent elements included in decoder 200 will be described.

[Overall Flow of Decoding Process]

FIG. 42 is a flow chart illustrating one example of an overall decoding process performed by decoder 200.

First, entropy decoder 202 of decoder 200 identifies a splitting pattern of a block having a fixed size (for example, 128×128 pixels) (Step Sp_1). This splitting pattern is a splitting pattern selected by encoder 100. Decoder 200 then performs processes of Step Sp_2 to Sp_6 for each of a plurality of blocks of the splitting pattern.

In other words, entropy decoder 202 decodes (specifically, entropy-decodes) encoded quantized coefficients and a prediction parameter of a current block to be decoded (also referred to as a current block) (Step Sp_2).

Next, inverse quantizer 204 performs inverse quantization of the plurality of quantized coefficients and inverse transformer 206 performs inverse transform of the result, to restore a plurality of prediction residuals (that is, a difference block) (Step Sp_3).

Next, the prediction processor including all or part of intra predictor 216, inter predictor 218, and prediction controller 220 generates a prediction signal (also referred to as a prediction block) of the current block (Step Sp_4).

Next, adder 208 adds the prediction block to the difference block to generate a reconstructed image (also referred to as a decoded image block) of the current block (Step Sp_5).

When the reconstructed image is generated, loop filter 212 performs filtering of the reconstructed image (Step Sp_6).

Decoder 200 then determines whether decoding of the entire picture has been finished (Step Sp_7). When determining that the decoding has not yet been finished (No in Step Sp_7), decoder 200 repeatedly executes the processes starting with Step Sp_1.

As illustrated, the processes of Steps Sp_1 to Sp_7 are performed sequentially by decoder 200. Alternatively, two or more of the processes may be performed in parallel, the processing order of the two or more of the processes may be modified, etc.

[Entropy Decoder]

Entropy decoder 202 entropy decodes an encoded bitstream. More specifically, for example, entropy decoder 202 arithmetic decodes an encoded bitstream into a binary signal. Entropy decoder 202 then debinarizes the binary signal. With this, entropy decoder 202 outputs quantized coefficients of each block to inverse quantizer 204. Entropy decoder 202 may output a prediction parameter included in an encoded bitstream (see FIG. 1) to intra predictor 216, inter predictor 218, and prediction controller 220. Intra predictor 216, inter predictor 218, and prediction controller 220 in an embodiment are capable of executing the same prediction processes as those performed by intra predictor 124, inter predictor 126, and prediction controller 128 at the encoder side.

[Inverse Quantizer]

Inverse quantizer 204 inverse quantizes quantized coefficients of a block to be decoded (hereinafter referred to as a current block) which are inputs from entropy decoder 202. More specifically, inverse quantizer 204 inverse quantizes quantized coefficients of the current block, based on quantization parameters corresponding to the quantized coefficients. Inverse quantizer 204 then outputs the inverse quantized transform coefficients of the current block to inverse transformer 206.

[Inverse Transformer]

Inverse transformer 206 restores prediction errors by inverse transforming the transform coefficients which are inputs from inverse quantizer 204.

For example, when information parsed from an encoded bitstream indicates that EMT or AMT is to be applied (for example, when an AMT flag is true), inverse transformer 206 inverse transforms the transform coefficients of the current block based on information indicating the parsed transform type.

Moreover, for example, when information parsed from an encoded bitstream indicates that NSST is to be applied, inverse transformer 206 applies a secondary inverse transform to the transform coefficients.

[Adder]

Adder 208 reconstructs the current block by adding prediction errors which are inputs from inverse transformer 206 and prediction samples which are inputs from prediction controller 220. Adder 208 then outputs the reconstructed block to block memory 210 and loop filter 212.

[Block Memory]

Block memory 210 is storage for storing blocks in a picture to be decoded (hereinafter referred to as a current picture) and to be referred to in intra prediction. More specifically, block memory 210 stores reconstructed blocks output from adder 208.

[Loop Filter]

Loop filter 212 applies a loop filter to blocks reconstructed by adder 208, and outputs the filtered reconstructed blocks to frame memory 214, display device, etc.

When information indicating ON or OFF of an ALF parsed from an encoded bitstream indicates that an ALF is ON, one filter from among a plurality of filters is selected based on direction and activity of local gradients, and the selected filter is applied to the reconstructed block.

[Frame Memory]

Frame memory 214 is, for example, storage for storing reference pictures for use in inter prediction, and is also referred to as a frame buffer. More specifically, frame memory 214 stores a reconstructed block filtered by loop filter 212.

[Prediction Processor (Intra Predictor, Inter Predictor, Prediction Controller)]

FIG. 43 is a flow chart illustrating one example of a process performed by a prediction processor of decoder 200. It is to be noted that the prediction processor includes all or part of the following constituent elements: intra predictor 216; inter predictor 218; and prediction controller 220.

The prediction processor generates a prediction image of a current block (Step Sq_1). This prediction image is also referred to as a prediction signal or a prediction block. It is to be noted that the prediction signal is, for example, an intra prediction signal or an inter prediction signal. Specifically, the prediction processor generates the prediction image of the current block using a reconstructed image which has been already obtained through generation of a prediction block, generation of a difference block, generation of a coefficient block, restoring of a difference block, and generation of a decoded image block.

The reconstructed image may be, for example, an image in a reference picture, or an image of a decoded block in a current picture which is the picture including the current block. The decoded block in the current picture is, for example, a neighboring block of the current block.

FIG. 44 is a flow chart illustrating another example of a process performed by the prediction processor of decoder 200.

The prediction processor determines either a method or a mode for generating a prediction image (Step Sr_1). For example, the method or mode may be determined based on, for example, a prediction parameter, etc.

When determining a first method as a mode for generating a prediction image, the prediction processor generates a prediction image according to the first method (Step Sr_2 a). When determining a second method as a mode for generating a prediction image, the prediction processor generates a prediction image according to the second method (Step Sr_2 b). When determining a third method as a mode for generating a prediction image, the prediction processor generates a prediction image according to the third method (Step Sr_2 c).

The first method, the second method, and the third method may be mutually different methods for generating a prediction image. Each of the first to third methods may be an inter prediction method, an intra prediction method, or another prediction method. The above-described reconstructed image may be used in these prediction methods.

[Intra Predictor]

Intra predictor 216 generates a prediction signal (intra prediction signal) by performing intra prediction by referring to a block or blocks in the current picture stored in block memory 210, based on the intra prediction mode parsed from the encoded bitstream. More specifically, intra predictor 216 generates an intra prediction signal by performing intra prediction by referring to samples (for example, luma and/or chroma values) of a block or blocks neighboring the current block, and then outputs the intra prediction signal to prediction controller 220.

It is to be noted that when an intra prediction mode in which a luma block is referred to in intra prediction of a chroma block is selected, intra predictor 216 may predict the chroma component of the current block based on the luma component of the current block.

Moreover, when information parsed from an encoded bitstream indicates that PDPC is to be applied, intra predictor 216 corrects intra-predicted pixel values based on horizontal/vertical reference pixel gradients.

[Inter Predictor]

Inter predictor 218 predicts the current block by referring to a reference picture stored in frame memory 214. Inter prediction is performed in units of a current block or a sub-block (for example, a 4×4 block) in the current block. For example, inter predictor 218 generates an inter prediction signal of the current block or the sub-block by performing motion compensation by using motion information (for example, a motion vector) parsed from an encoded bitstream (for example, a prediction parameter output from entropy decoder 202), and outputs the inter prediction signal to prediction controller 220.

It is to be noted that when the information parsed from the encoded bitstream indicates that the OBMC mode is to be applied, inter predictor 218 generates the inter prediction signal using motion information of a neighboring block in addition to motion information of the current block obtained from motion estimation.

Moreover, when the information parsed from the encoded bitstream indicates that the FRUC mode is to be applied, inter predictor 218 derives motion information by performing motion estimation in accordance with the pattern matching method (bilateral matching or template matching) parsed from the encoded bitstream. Inter predictor 218 then performs motion compensation (prediction) using the derived motion information.

Moreover, when the BIO mode is to be applied, inter predictor 218 derives a motion vector based on a model assuming uniform linear motion. Moreover, when the information parsed from the encoded bitstream indicates that the affine motion compensation prediction mode is to be applied, inter predictor 218 derives a motion vector of each sub-block based on motion vectors of neighboring blocks.

[MV Derivation>Normal Inter Mode]

When information parsed from an encoded bitstream indicates that the normal inter mode is to be applied, inter predictor 218 derives an MV based on the information parsed from the encoded bitstream and performs motion compensation (prediction) using the MV.

FIG. 45 is a flow chart illustrating an example of inter prediction in normal inter mode in decoder 200.

Inter predictor 218 of decoder 200 performs motion compensation for each block. Inter predictor 218 obtains a plurality of MV candidates for a current block based on information such as MVs of a plurality of decoded blocks temporally or spatially surrounding the current block (Step Ss_1). In other words, inter predictor 218 generates an MV candidate list.

Next, inter predictor 218 extracts N (an integer of 2 or larger) MV candidates from the plurality of MV candidates obtained in Step Ss_1, as motion vector predictor candidates (also referred to as MV predictor candidates) according to a determined priority order (Step Ss_2). It is to be noted that the priority order may be determined in advance for each of the N MV predictor candidates.

Next, inter predictor 218 decodes motion vector predictor selection information from an input stream (that is, an encoded bitstream), and selects, one MV predictor candidate from the N MV predictor candidates using the decoded motion vector predictor selection information, as a motion vector (also referred to as an MV predictor) of the current block (Step Ss_3).

Next, inter predictor 218 decodes an MV difference from the input stream, and derives an MV for a current block by adding a difference value which is the decoded MV difference and a selected motion vector predictor (Step Ss_4).

Lastly, inter predictor 218 generates a prediction image for the current block by performing motion compensation of the current block using the derived MV and the decoded reference picture (Step Ss_5).

[Prediction Controller]

Prediction controller 220 selects either the intra prediction signal or the inter prediction signal, and outputs the selected prediction signal to adder 208. As a whole, the configurations, functions, and processes of prediction controller 220, intra predictor 216, and inter predictor 218 at the decoder side may correspond to the configurations, functions, and processes of prediction controller 128, intra predictor 124, and inter predictor 126 at the encoder side.

Mounting Example of Decoder

FIG. 46 is a block diagram illustrating a mounting example of decoder 200. Decoder 200 includes processor b1 and memory b2. For example, the plurality of constituent elements of decoder 200 illustrated in FIG. 41 are mounted on processor b1 and memory b2 illustrated in FIG. 46.

Processor b1 is circuitry which performs information processing and is accessible to memory b2. For example, processor b1 is dedicated or general electronic circuitry which decodes a video (that is, an encoded bitstream). Processor b1 may be a processor such as a CPU. In addition, processor b1 may be an aggregate of a plurality of electronic circuits. In addition, for example, processor b1 may take the roles of two or more constituent elements out of the plurality of constituent elements of decoder 200 illustrated in FIG. 41, etc.

Memory b2 is dedicated or general memory for storing information that is used by processor b1 to decode an encoded bitstream. Memory b2 may be electronic circuitry, and may be connected to processor b1. In addition, memory b2 may be included in processor b1. In addition, memory b2 may be an aggregate of a plurality of electronic circuits. In addition, memory b2 may be a magnetic disc, an optical disc, or the like, or may be represented as a storage, a recording medium, or the like. In addition, memory b2 may be a non-volatile memory, or a volatile memory.

For example, memory b2 may store a video or a bitstream. In addition, memory b2 may store a program for causing processor b1 to decode an encoded bitstream.

In addition, for example, memory b2 may take the roles of two or more constituent elements for storing information out of the plurality of constituent elements of decoder 200 illustrated in FIG. 41, etc. Specifically, memory b2 may take the roles of block memory 210 and frame memory 214 illustrated in FIG. 41. More specifically, memory b2 may store a reconstructed block, a reconstructed picture, etc.

It is to be noted that, in decoder 200, all of the plurality of constituent elements illustrated in FIG. 41, etc. may not be implemented, and all the processes described above may not be performed. Part of the constituent elements indicated in FIG. 41, etc. may be included in another device, or part of the processes described above may be performed by another device.

Definitions of Terms

The respective terms may be defined as indicated below as examples.

A picture is an array of luma samples in monochrome format or an array of luma samples and two corresponding arrays of chroma samples in 4:2:0, 4:2:2, and 4:4:4 color format. A picture may be either a frame or a field.

A frame is the composition of a top field and a bottom field, where sample rows 0, 2, 4, . . . originate from the top field and sample rows 1, 3, 5, . . . originate from the bottom field.

A slice is an integer number of coding tree units contained in one independent slice segment and all subsequent dependent slice segments (if any) that precede the next independent slice segment (if any) within the same access unit.

A tile is a rectangular region of coding tree blocks within a particular tile column and a particular tile row in a picture. A tile may be a rectangular region of the frame that is intended to be able to be decoded and encoded independently, although loop-filtering across tile edges may still be applied.

A block is an M×N (M-column by N-row) array of samples, or an M×N array of transform coefficients. A block may be a square or rectangular region of pixels including one Luma and two Chroma matrices.

A coding tree unit (CTU) may be a coding tree block of luma samples of a picture that has three sample arrays, or two corresponding coding tree blocks of chroma samples. Alternatively, a CTU may be a coding tree block of samples of one of a monochrome picture and a picture that is coded using three separate color planes and syntax structures used to code the samples.

A super block may be a square block of 64×64 pixels that consists of either 1 or 2 mode info blocks or is recursively partitioned into four 32×32 blocks, which themselves can be further partitioned.

Aspect 1

Hereinafter, descriptions are given of encoder 100, decoder 200, an encoding method, and a decoding method according to Aspect 1 of the present disclosure. Encoder 100 according to Aspect 1 switches methods of quantization processing on a current block to be encoded (hereinafter also referred to as a current block to be processed or a current CU to be processed), according to application or non-application of frequency transform processing (hereinafter also simply referred to as transform processing) such as orthogonal transform and secondary transform. Decoder 200 according to Aspect 1 switches methods of quantization processing on a current block to be decoded (hereinafter also referred to as a current block to be processed or a current CU to be processed), according to application or non-application of inverse frequency transform processing (hereinafter also simply referred to as inverse transform processing) such as inverse orthogonal transform and inverse secondary transform.

Encoder 100 reduces the overall amount of codes by performing frequency transform and quantization on prediction errors of a current block to be encoded. The frequency transform is performed using a transform basis. For example, encoder 100 determines a transform basis by selecting from a plurality of transform basis candidates, and performs the frequency transform using the transform basis determined. Encoder 100 may perform re-transform (what is called secondary transform) so that a larger number of coefficients which are 0 (referred to as zero coefficients) occur sequentially before quantization after frequency transform. In this case, the frequency transform is also represented as orthogonal transform or primary transform. It is to be noted that decoder 200 performs an operation corresponding to an operation performed by encoder 100.

First, a method of selecting a transform basis in transform processing is described.

[A Method of Selecting a Transform Basis in Implicit MTS (IMTS)]

Transformer 106 in encoder 100 transforms prediction errors in a spatial domain into transform coefficients in a frequency domain, and outputs the transform coefficients to quantizer 108. Specifically, for example, transformer 106 performs predetermined discrete cosine transform (DCT) or discrete sine transform (DST) on the prediction errors in the spatial domain. Alternatively, transformer 106 may adaptively select a transform type from among a plurality of transform types, and transform the prediction errors into the transform coefficients using a transform basis function (hereinafter also referred to as a transform basis or a basis) corresponding to the transform type selected. Such transform may be referred to as adaptive multiple transform (AMT) or explicit multiple core transform (EMT). Alternatively, ATM and EMT may be referred to as multiple transform selection (MTS).

When applying MTS, transformer 106 selects an orthogonal transform basis (also referred to as a primary transform basis) which is for example DST-VII or DCT-VIII (see FIG. 5A). The basis selected is to be encoded as index information for each CU.

On the other hand, there is processing such as IMTS as processing of selecting a basis (what is called an orthogonal transform basis) for use in orthogonal transform based on the shape of a CU without encoding such index information. When applying IMTS in an example case where a current CU has a rectangular shape, transformer 106 performs orthogonal transform on the short-side portions of the current rectangle CU using the transform basis function corresponding to DST-VII (see FIG. 5A), and performs orthogonal transform on the long-side portions of the current rectangle CU using the transform basis function corresponding to DCT-II. In an example case where a current CU has a square shape, transformer 106 performs orthogonal transform on prediction errors in the square domain using the transform basis function corresponding to DCT-II when MTS is valid in a sequence, and performs orthogonal transform on the prediction errors in the square domain using the transform basis function corresponding to DST-VII when MTS is invalid. It is to be noted that DCT-II and DST-VII are examples, and thus other bases may be used, or the above basis combination may be a different combination. IMTS may be used only in an intra-prediction block, or may be used in both an intra-prediction block and an inter-prediction block.

Three kinds of processing (hereinafter also referred to as basis selection processing) which are MTS, SBT, and IMTS have been described above as methods of selectively switching bases for use in orthogonal transform. However, all the three kinds of processing may be valid, or only some kinds of the processing selected from the three kinds of processing may be valid. Whether each of the three kinds of basis selection processing is set to be valid can be identified by, for example, flag information in a header. The flag information is a Sequence Parameter Set (SPS), or the like. For example, when all the three kinds of basis selection processing are valid, one of the three kinds of basis selection processing is selected and then orthogonal transform is performed using the basis selection processing selected. It is only necessary that the processing of selectively switching bases for use in orthogonal transform provide at least one of the following functions: (1) orthogonal-transforming the entire range in a CU, and encoding information indicating the basis used in the transform; (2) orthogonal-transforming the entire range in a CU, and determining a basis based on a predetermined rule without encoding information indicating the basis used in the transform; (3) orthogonal-transforming a partial domain of a CU, and encoding information indicating the basis used in the transform; and (4) orthogonal-transforming a partial domain of a CU, and determining a basis based on a predetermined rule without encoding information indicating the basis used in the transform. Alternatively, for example, basis selection processing different from any of the three kinds of processing may be added, or other processing may replace any of the three kinds of processing.

Although the example processing of selecting the basis for use in orthogonal transform for each unit which is a CU has been described here, the unit of processing is not limited to the CU. In other words, whether to apply MTS, SBT, and IMTS may be determined for each unit of processing different from the CU. For example, whether to apply the processing may be determined for each unit which is a sequence, a picture, a tile, a slice or a CTU.

It is to be noted that a tool for selectively switching bases for use in orthogonal transform in the present disclosure may be stated differently as a method of adaptively selecting a basis for use in transform processing (what is called orthogonal transform) or a process for selecting either basis selection processing or a basis. Alternatively, the tool for selectively switching bases may be stated differently as a mode for adaptively selecting a transform basis.

In addition, transformer 106 may perform re-transform (hereinafter also referred to as secondary transform) on transform coefficients obtained through orthogonal transform. Such re-transform may be referred to as non-separable secondary transform (NSST). For example, transformer 106 may perform re-transform for each sub-block (for example, a 4×4 sub-block) included in a block of transform coefficients corresponding to intra-prediction errors. Information indicating whether to apply NSST and information regarding a transform matrix for use in NSST are normally transformed into signals at a CU level. Hereinafter, transforming information, etc. into signals is also referred to as signaling.

It is to be noted that there is no need to limit to the transform of the information into signals that is performed at the CU level, and such transform may be performed at another level (for example, at a sequence, picture, slice, tile, or CTU level).

[Encoding and Decoding According to Aspect 1]

First, encoding according to Aspect 1 of the present disclosure is described. As described above, in the encoding according to Aspect 1, encoder 100 switches quantization processing on a current block to be encoded, according to application or non-application of transform processing such as orthogonal transform and secondary transform.

Encoder 100 includes circuitry and memory coupled to the circuitry. The circuitry and memory of encoder 100 may correspond to processor a1 and memory a2 illustrated in FIG. 40. In operation, the circuitry of encoder 100 performs the processing indicated below.

Encoder 100 according to Aspect 1 performs quantization on a plurality of transform coefficients of a current block to be encoded, using a quantization matrix (QM) when orthogonal transform is performed on the current block and secondary transform is not performed on the current block; and performs quantization on the plurality of transform coefficients of the current block without using the quantization matrix when orthogonal transform is not performed on the current block and when both orthogonal transform and secondary transform are performed on the current block.

In other words, in Aspect 1, encoder 100 determines whether to use a quantization matrix in the quantization processing, based on the information for each unit which is the current block to be encoded indicating whether transform processing (what is called orthogonal transform processing) on the current block has been skipped and whether secondary transform on the plurality of transform coefficients in the current block has been skipped.

Alternatively, encoder 100 according to Aspect 1 may determine whether to use a quantization matrix in the quantization processing on the current block, based on information indicating whether orthogonal transform on the current block has been performed and whether secondary transform has been performed on the plurality of transform coefficients in the current block.

Hereinafter, the quantization processing in Aspect 1 is described more specifically with reference to the drawings. FIG. 47 is a flow chart indicating one example of an operation in the quantization processing performed by encoder 100 according to Aspect 1.

As described in FIG. 47, encoder 100 firstly determines whether orthogonal transform processing on a current block (CU) to be encoded has been skipped (Step S001).

In the orthogonal transform processing, transformer 106 (see FIG. 1) may (i) perform predetermined orthogonal transform such as discrete cosine transform (DCT) on a CU (more specifically, prediction residuals in the spatial domain of the CU), or (ii) may adaptively select a transform type from among a plurality of transform types, and perform orthogonal transform on the CU using a transform basis function corresponding to the transform type selected. Alternatively, encoder 100 may switch whether to skip orthogonal transform processing on a CU for each unit that is a block to be processed (that is, for each CU). At this time, for example, encoder 100 may encode flag information (for example, a transform skip flag), or the like for each unit that is the block (CU), and perform signaling as to whether to perform orthogonal transform on the CU.

As described in FIG. 47, in the case where encoder 100 determines that orthogonal transform processing on the CU has been skipped (Yes in Step S001), that is, when encoder 100 does not perform orthogonal transform on the CU, encoder 100 performs quantization on the CU (more specifically, the prediction errors in the spatial domain of the CU obtained), without using a quantization matrix (QM) (Step S004).

In the opposite case where encoder 100 determines that orthogonal transform processing on the CU has not been skipped (No in Step S001), that is, when encoder 100 performs orthogonal transform on the CU, encoder 100 determines whether secondary transform processing on the CU has been skipped (Step S002). In Aspect 1, encoder 100 may perform orthogonal transform such as DCT, and then perform secondary transform on coefficient values in the orthogonal transform. For example, the secondary transform may be NSST.

In the case where encoder 100 determines that secondary transform processing on the CU has not been skipped (No in Step S002), in other words, when encoder 100 performs secondary transform on a plurality of transform coefficients of the CU, encoder 100 performs quantization on the CU without using the quantization matrix (QM) (Step S004). The coefficient distribution after the secondary transform is different from the coefficient distribution in the orthogonal transform such as DCT. Thus, the CU to which secondary transform has been applied may be quantized without using the QM. The quantization processing performed without using the QM may be processing of quantizing transform coefficients based on a quantization width which can be calculated based on a quantization parameter. It is to be noted that, in the quantization processing performed without using the QM, a predetermined value common to all the secondary transform coefficients in a block may be multiplied to the quantization width.

In the opposite case where encoder 100 determines that secondary transform processing on the CU has been skipped (Yes in Step S002), in other words, encoder 100 does not perform secondary transform on the CU, encoder 100 performs quantization on the CU (more specifically, a plurality of transform coefficients in the CU obtained) using a quantization matrix (QM) (Step S003). When using the QM, for example, encoder 100 performs, using a value in the QM for each transform coefficient, scaling of the quantization width, or the like which can be calculated based on a quantization parameter, or the like.

It is to be noted that encoder 100 may switch whether to validate skipping of transform processing (that is, orthogonal transform processing and secondary transform processing), according to the size of a current block (CU). For example, encoder 100 always invalidates skipping of transform processing on a current block whose short-side length exceeds 32.

It is to be noted that, in intra prediction, encoder 100 may split a current block into a plurality of sub-partitions, and sequentially perform intra prediction for each sub-partition by referring to a prediction image or a reconstructed image of an encoded sub-partition in the current block (this is referred to as an intra sub-partition mode). In the encoding of the current block to which such intra sub-partition mode has been applied, quantization processing is performed for each sub-partition. Also in this case, encoder 100 is capable of specifying whether to skip transform processing for each unit that is a current block (for each CU). For example, when orthogonal transform processing on the current block has been skipped, encoder 100 may perform quantization processing on all the sub-partitions in the current block without using the QM.

It is to be noted that encoder 100 may directly encode pixel values of a current image to be encoded according to an approach such as differential pulse-code modulation (DPCM), without performing any prediction processing. In other words, also when the pixel values of the current block have been encoded according to the approach such as DPCM, encoder 100 may perform quantization processing on the CU without using the QM.

Here, it is only necessary that the current block be a unit of processing including a plurality of pixels, and thus the current block may be a unit of processing including a plurality of CUs.

A QM provides an effect of adjusting a subjective image quality by scaling a quantization width, or the like of coefficients in the domain after being subjected to transform such as orthogonal transform. Thus, there is a possibility that a sufficient effect is not obtained even if a QM is applied when transform processing has been skipped. Accordingly, there is a possibility that decrease in subjective image quality can be reduced by performing quantization processing without using any QM when transform processing on a block has been skipped in the encoding in Aspect 1.

This processing flow is one example, and thus it is to be noted that the processing order described may be changed, part of the processing may be removed, and processing which is not described may be added. For example, the encoding in Aspect 1 may be applied to encoding according to Aspect 2, Aspect 3, or Aspect 4 to be described later. These aspects relate to encoding of rectangular blocks. Furthermore, the encoding in Aspect 1 may be applied to encoding of blocks having a shape other than a rectangular shape.

Next, decoding according to Aspect 1 is described. As described above, in the decoding according to Aspect 1, inverse quantization processing is switched for a current block to be decoded, according to application or non-application of inverse transform processing such as inverse orthogonal transform and inverse secondary transform on the current block.

Decoder 200 includes circuitry and memory coupled to the circuitry. The circuitry and memory of decoder 200 may correspond to processor b1 and memory b2 illustrated in FIG. 46. In operation, the circuitry of decoder 200 performs the processing indicated below.

Decoder 200 according to Aspect 1 performs inverse quantization on a plurality of transform coefficients of a current block to be decoded, using a quantization matrix (QM) when inverse orthogonal transform is performed on the current block and inverse secondary transform is not performed on the current block; and performs inverse quantization on the plurality of transform coefficients of the current block without using the quantization matrix when inverse orthogonal transform is not performed on the current block and when both inverse orthogonal transform and inverse secondary transform are performed on the current block.

In other words, in Aspect 1, decoder 200 determines whether to use the quantization matrix in the inverse quantization processing, based on the information for each unit which is the current block to be decoded indicating whether inverse transform processing (what is called inverse orthogonal transform processing) on the current block has been skipped and whether inverse secondary transform processing on the current block has been skipped.

Alternatively, decoder 200 according to Aspect 1 may determine whether to use a quantization matrix in the inverse quantization processing on the current block, based on information indicating whether inverse orthogonal transform on the current block has been performed and whether inverse secondary transform on a plurality of transform coefficients in the current block has been performed.

Hereinafter, the inverse quantization processing in Aspect 1 is described more specifically with reference to the drawings. FIG. 48 is a flow chart indicating one example of an operation in the inverse quantization processing performed by decoder 200 according to Aspect 1.

As described in FIG. 48, decoder 200 firstly determines whether inverse orthogonal transform processing on a current block (CU) to be decoded is skipped (Step S011).

In the inverse transform processing, inverse transformer 206 (see FIG. 41) restores prediction errors by inverse-transforming transform coefficients which are input from inverse quantizer 204.

For example, when information parsed from an encoded bitstream indicates application of EMT or AMT (for example, when an AMT flag is true), inverse transformer 206 inverse-transforms the transform coefficients of the current block based on the information indicating the transform type parsed. As another example, when information parsed from an encoded bitstream indicates application of NSST, inverse transformer 206 applies inverse transform to the transformed coefficients.

Alternatively, decoder 200 may switch whether to skip inverse orthogonal transform processing on a CU for each unit of a block to be processed (that is, for each CU). At this time, for example, decoder 200 may decode flag information (for example, an inverse transform skip flag) for each unit of processing that is a current block (CU) to be processed, and parse whether inverse orthogonal transform is performed on the CU.

In the decoding, decoder 200 determines whether prediction residuals have been transformed, based on the flag information described above. It is to be noted that whether to validate skipping of inverse transform may be identified based on identification information included in header information in an SPS, a PPS, or the like.

As illustrated in FIG. 48, in the case where decoder 200 determines that inverse orthogonal transform processing on the CU is skipped (Yes in Step S011), in other words, when decoder 200 does not perform inverse orthogonal transform on the CU, decoder 200 performs inverse quantization on the CU (more specifically, a plurality of quantized coefficients in the CU) without using a quantization matrix (QM) (Step S014).

In the inverse quantization processing, inverse quantizer 204 of decoder 200 (see FIG. 41) inverse-quantizes quantized coefficients of the current block which are input from entropy decoder 202 (see FIG. 41). Specifically, inverse quantizer 204 inverse-quantizes each of the quantized coefficients of the current block, based on a quantization parameter corresponding to the quantized coefficient. Subsequently, inverse quantizer 204 outputs, to inverse transformer 206, the quantized coefficients (that are transform coefficients) which have been inverse-quantized of the current block (see FIG. 41).

In the opposite case where decoder 200 determines that inverse orthogonal transform processing on the CU is not skipped (No in Step S011), in other words, when decoder 200 performs inverse orthogonal transform on the CU, decoder 200 determines whether inverse secondary transform processing on the CU is skipped (Step S012). For example, when information parsed from an encoded bitstream indicates that secondary transform processing (for example, NSST) is applied, decoder 200 determines that inverse secondary transform processing on the CU is performed.

In the case where decoder 200 determines that inverse secondary transform processing on the CU is not skipped (No in Step S012), that is, when decoder 200 performs inverse secondary transform on a plurality of secondary transform coefficients in the CU, decoder 200 performs inverse quantization on the CU without using the quantization matrix (QM) (Step S014).

In the opposite case where decoder 200 determines that inverse secondary transform processing on the CU is skipped (Yes in Step S012), that is, when decoder 200 does not perform inverse secondary transform on the CU, decoder 200 performs inverse quantization on the CU (more specifically, a plurality of quantized coefficients in the CU) using a quantization matrix (QM) (Step S013).

It is to be noted that decoder 200 may switch whether to validate skipping of the inverse transform processing (that is the inverse orthogonal transform processing and the inverse secondary transform processing described above) according to the size of the current block (CU). For example, decoder 200 always invalidates skipping of the inverse transform processing in a current block whose short-side length exceeds 32.

It is to be noted that, in intra prediction, encoder 100 may split a current block into a plurality of sub-partitions, and sequentially perform intra prediction for each sub-partition by referring to a prediction image or a reconstructed image of a decoded sub-partition (this is referred to as an intra sub-partition mode). In the decoding of the current block to which such intra sub-partition mode has been applied, inverse quantization processing is performed for each sub-partition. Also in this case, decoder 200 is capable of specifying whether to skip inverse transform processing for each unit that is a current block (for each CU). For example, when inverse orthogonal transform processing on the current block has been skipped, decoder 200 may perform inverse quantization processing on all the sub-partitions in the current block without using the QM.

Here, it is only necessary that the current block be a unit of processing including a plurality of pixels, and thus the current block may be a unit of processing including a plurality of CUs.

Accordingly, there is a possibility that decrease in subjective image quality can be reduced by performing inverse quantization processing without using the QM when inverse transform processing on a block has been skipped in the decoding in Aspect 1.

This processing flow is one example, and thus it is to be noted that the processing order described may be changed, part of the processing may be removed, and processing which is not described may be added. Alternatively, for example, the decoding according to Aspect 1 may be applied to Aspect 2, Aspect 3, or Aspect 4 to be described later. These aspects relate to decoding of rectangular blocks. Furthermore, the decoding according to Aspect 1 may be applied to decoding of blocks having a shape other than a rectangular shape.

[Effects of Aspect 1 relating to Encoding and Decoding]

As described above, a quantization matrix provides an effect of adjusting a subjective image quality by scaling a quantization width, or the like of coefficients in a domain after transform such as orthogonal transform. Thus, there is a possibility that a sufficient effect is not obtained even if a quantization matrix is applied to prediction residuals of a plurality of pixel value in a current block to be encoded, when no orthogonal transform on the current block is performed. In addition, when orthogonal transform and secondary transform are performed on the current block, since a plurality of transform coefficients in the current block after the orthogonal transform has been re-transformed, there is a possibility that a sufficient effect is not obtained even if a quantization matrix is applied to the coefficients re-transformed. For this reason, encoder 100 according to Aspect 1 of the present disclosure configured as described with reference to FIG. 47 performs quantization on the current block to be encoded which may not provide a sufficient effect of adjusting the subjective image quality even if the quantization matrix is applied thereto, without using the quantization matrix, which reduces the processing amount. Furthermore, encoder 100 according to Aspect 1 of the present disclosure is capable of appropriately applying the quantization matrix to the plurality of prediction residuals in the current block after orthogonal transform has been performed thereon, which provides an effect of adjusting the subjective image quality. Accordingly, encoder 100 according to Aspect 1 of the present disclosure is capable of appropriately determining whether to use the quantization matrix for the current block in the quantization processing, which makes it possible to increase the coding efficiency while reducing decrease in subjective image quality both in a case in which the quantization matrix is applied and in a case of the quantization matrix is not applied.

Furthermore, decoder 200 according to Aspect 1 of the present disclosure configured as described with reference to FIG. 48 performs inverse quantization, without using the quantization matrix, on a current block to be decoded which may not provide a sufficient effect of adjusting a subjective image quality even if a quantization matrix is applied thereto, which reduces the processing amount. Furthermore, decoder 200 according to Aspect 1 of the present disclosure is capable of appropriately applying the quantization matrix to the current block after orthogonal transform and quantization have been performed thereon, which provides an effect of adjusting the subjective image quality. Accordingly, decoder 200 according to Aspect 1 of the present disclosure is capable of appropriately determining whether to use the quantization matrix for the current block in the inverse quantization processing, which makes it possible to increase the processing efficiency while reducing decrease in subjective image quality both in the case in which the quantization matrix is applied and in the case of the quantization matrix is not applied.

[A Variation of Aspect 1 relating to Encoding and Decoding]

In the encoding and decoding according to Aspect 1, the following processing may be applied.

For example, information indicating whether to validate scaling using a quantization matrix (QM) may be indicated by flag information included in header information in an SPS, a PPS, or the like.

Alternatively, whether to validate skipping of transform processing and skipping of inverse transform processing may be determined according to the size of a current block to be encoded and the size of a current block to be decoded, respectively. Hereinafter, the current block to be encoded and the current block to be decoded are also collectively referred to as current blocks to be processed. For example, skipping of transform processing and inverse transform processing may be always invalidated for the current blocks to be processed each having a predetermined size or more.

Alternatively, whether to validate skipping of transform processing and inverse transform processing may be set based on conditions different between luminance signals and chrominance signals in the current block to be processed. For example, skipping of transform processing and inverse transform processing may be applied only to the luminance signals. At this time, for the luminance signals, whether to perform scaling using a QM may be determined based on information indicating whether to apply skipping of transform processing and inverse transform processing on the current blocks to be processed. At this time, since skipping of transform processing and inverse transform processing on the chrominance signals are always invalidated, scaling using the QM is performed regardless of whether to apply transform processing and inverse transform processing to the current blocks (in other words, whether the skipping is valid or invalid). Alternatively, it is excellent that skipping of transform processing and inverse transform processing may be applicable to both the luminance signals and the chrominance signals. At this time, signaling regarding skipping of transform processing and inverse transform processing on the luminance signals and the chrominance signals may be made common by, for example, validating skipping of transform processing and inverse transform processing on the chrominance signals of the current blocks to be processed when skipping of transform processing and inverse transform processing on the luminance signals of the current blocks is valid. In addition, signaling regarding the luminance signals and signaling regarding the chrominance signals may be performed separately. At this time, for example, it is possible to perform control such as control to validate skipping of transform processing and inverse transform processing on the luminance signals, and to invalidate skipping of transform processing and inverse transform processing on the chrominance signals. When signaling regarding skipping of transform processing on luminance signals and signaling regarding skipping chrominance signals are common, whether to perform scaling using a QM may be determined based on common signaling information. On the other hand, when signaling regarding luminance signals and signaling regarding chrominance signals are performed separately, skipping of transform processing on the luminance signals and skipping of transform processing on the chrominance signals may be applied separately based on the signaling information regarding the luminance signals and the signaling information regarding the chrominance signals, respectively. For example, when transform processing on the luminance signals is skipped, control may be performed so as not to perform scaling using a QM on the luminance signals.

As described above, encoder 100 is capable of directly encoding pixel values of a current image to be encoded according to an approach that is for example differential pule-code modulation (DPCM) or pulse-code modulation (PCM), without performing transform processing as described above. At this time, encoder 100 may directly encode residual signals between an original image and a prediction image after performing prediction processing, instead of directly encoding the pixel values of the current image to be encoded. In addition, encoder 100 may allow selection on whether to quantize signals which have been directly encoded. At this time, encoder 100 may apply scaling using a QM when quantizing signals which have been directly encoded, or may always invalidate scaling using the QM when not quantizing signals which have been directly encoded. Alternatively, encoder 100 may always invalidate scaling using a QM even when quantizing signals which have been directly encoded. Furthermore, encoder 100 may use either a QM for intra prediction and a QM for inter prediction when quantizing signals which have been directly encoded, or may set a unique QM and encode the unique QM in an SPS header or a PPS header.

It is to be noted that the above-described processing may be applied to encoding and decoding in each of Aspect 1 to Aspect 4.

Aspect 2

Hereinafter, descriptions are given of encoder 100, decoder 200, an encoding method, and a decoding method according to Aspect 2 of the present disclosure.

In the encoding according to Aspect 1, quantization processing is switched according to application or non-application of transform processing on the current block to be encoded. In Aspect 2, a QM for a rectangular block is generated based on a QM for a square block when a current block to be encoded has a rectangular shape, and then quantization processing is performed on the current block using the QM.

When the current block is the rectangular block, encoder 100 according to Aspect 2 of the present disclosure may generate a second quantization matrix corresponding to a plurality of transform coefficients of the rectangular block by transforming a first quantization matrix corresponding to a plurality of transform coefficients of a square block, and quantize the plurality of transform coefficients of the rectangular block using the second quantization matrix.

Hereinafter, encoding including the quantization processing according to Aspect 2 is described more specifically with reference to the drawings.

[Encoding and Decoding According to Aspect 2]

FIG. 49 is a flow chart indicating one example of a flow of encoding using a quantization matrix (QM) in encoder 100 according to Aspect 2. It is to be noted that encoder 100 described here performs encoding for each square or rectangular block obtained by splitting a picture (hereinafter also referred to as a frame) included in a video.

First, in Step S101, quantizer 108 generates a QM for a square block. The QM for the square block is a quantization matrix corresponding to a plurality of transform coefficients of a square block. Hereinafter, the QM for the square block is also referred to as a first quantization matrix. It is to be noted that quantizer 108 may generate the QM for the square block based on values which have been defined by a user and pre-set in encoder 100, or may adaptively generate the QM for the square block using encoded information of a picture which has been already encoded. In addition, entropy encoder 110 may describe, in a stream, a signal relating to the QM (that is, a QM signal) for the square block generated by quantizer 108. At this time, the QM for the square block may be encoded in an area in the stream. The area is one of a sequence header area, a picture header area, a slice header area, a supplemental information area, or another area storing another parameter. It is to be noted that the QM for the square block does not always need to be described in a stream. At this time, quantizer 108 may use default values in a QM for the square block that is a QM which has been pre-defined in a standard. Alternatively, entropy encoder 110 may describe, in the stream, only a part of coefficients required to generate the QM, instead of describing, in the stream, all the coefficients (that are quantized coefficients) in the QM for the square block. In this way, it is possible to reduce the amount of information to be encoded.

Next, in Step S102, quantizer 108 generates a QM for a rectangular block using the QM for the square block generated in Step S101. Hereinafter, the QM for the rectangular block is also referred to as a second quantization matrix. It is to be noted that entropy encoder 110 does not describe a QM signal for a rectangular block in the stream.

It is to be noted, as explained with reference to FIG. 49, that each of the processing in Step S101 and the processing in Step S102 may be performed on the blocks collectively at the time of starting processing of a sequence, a picture, or a slice, or may be performed each time when part of the processing is performed in processing of a unit that is a block. In addition, the QMs which are generated by quantizer 108 in Step S101 and Step S102 may be a plurality of kinds of QMs for blocks having the same block size which are generated by splitting a block, under conditions such as whether each QM is for a luminance block or for a chrominance block, each QM is for an intra-prediction block or for an inter-prediction block, and under other conditions.

Next, a block-based loop is started. First, in Step S103, one of intra predictor 124 and inter predictor 126 performs, for each block, prediction processing using a corresponding one of intra prediction and inter prediction. In Step S104, transformer 106 performs transform processing using discrete cosine transform (DCT), or the like on a generated prediction residual image. In Step S105, quantizer 108 performs quantization on generated transform coefficients using the QM for the square block and the QM for the rectangular block which are outputs in Step S101 and Step S102. It is to be noted that, in inter prediction, a mode for referring to a block in a picture to which a current block to be processed belongs may be used together with a mode for referring to a block in a picture different from a picture to which the current block belongs. At this time, the QM for inter prediction may be used commonly for both the modes, or the QM for intra prediction may be used to the mode for referring to the block in the picture to which the current block belongs. Furthermore, in Step S106, inverse quantizer 112 performs inverse quantization on quantized transform coefficients using the QM for the square block and the QM for the rectangular block which are outputs in Step S101 and Step S102. In Step S107, inverse transformer 114 performs inverse transform on the transform coefficients on which the inverse quantization has been performed to generate a residual (prediction error) image. Next, in Step S108, adder 116 adds the residual image and the prediction image to generate a reconstructed image. This sequential processing flow is repeated, and block-based loops end.

In this way, also in the encoding scheme for pictures including rectangular blocks which have various shapes, describing only QMs corresponding to square blocks in the stream enables encoding without describing QMs corresponding to the rectangular blocks having various shapes. In other words, encoder 100 according to Aspect 2 of the present disclosure does not require that the QMs corresponding to the rectangular blocks are described in the stream, which enables reduction in amount of codes of the header area. Furthermore, encoder 100 according to Aspect 2 of the present disclosure is capable of generating the QMs corresponding to the rectangular blocks based on the QMs corresponding to the square blocks, which makes it possible to use appropriate QMs also for the rectangular blocks without increasing the amount of codes of the header area. Thus, since encoder 100 according to Aspect 2 of the present disclosure is capable of efficiently quantizing the rectangular blocks having various shapes, which increases the possibility of being able to increase the coding efficiency. It is to be noted that the QMs for the square blocks do not necessarily need to be described in the stream, and default values in QMs for square blocks which have been pre-defined in a standard may be used.

It is to be noted that this processing flow is one example, and thus it is to be noted that the processing order described may be changed, part of the processing may be removed, and processing which is not described may be added.

Next, decoding according to Aspect 2 is described. In the decoding according to Aspect 1, inverse quantization processing is switched according to application or non-application of inverse transform processing on the current block to be decoded. In Aspect 2, a QM for a rectangular block is generated based on a QM for a square block when a current block to be decoded has a rectangular shape, and then inverse quantization processing on the current block is performed using the QM.

When the current block is a rectangular block, decoder 200 according to Aspect 2 may generate a second quantization matrix corresponding to a plurality of transform coefficients of the rectangular block by converting a first quantization matrix corresponding to a plurality of transform coefficients of a square block, and performs inverse quantization on the plurality of the transform coefficients of the rectangular block using the second quantization matrix.

Hereinafter, the inverse quantization processing according to Aspect 2 is described more specifically with reference to the drawings.

FIG. 50 is a flow chart indicating one example of a flow of decoding using a quantization matrix (QM) in decoder 200 according to Aspect 2. It is to be noted that decoder 200 described here performs decoding for each square or rectangular block obtained by splitting a frame.

First, in Step S201, entropy decoder 202 decodes a signal relating to the QM for the square block from a stream, and generates the QM for the square block using the decoded signal relating to the QM for the square block. It is to be noted that the QM for the square block may be decoded from an area in the stream. The area is one of a sequence header area, a picture header area, a slice header area, a supplemental information area, or another area storing another parameter. Alternatively, the QM for the square block does not always need to be decoded from the stream. At this time, default values which have been pre-defined in a standard may be used as values of the QM for the square block. Alternatively, entropy decoder 202 may generate the QM for the square block by decoding, from the stream, only a part of coefficients required to generate the QM for the square block, instead of decoding, from the stream, all the coefficients in the QM for the square block.

Next, in Step S202, entropy decoder 202 generates a QM for a rectangular block using the QM for the square block generated in Step S201. It is to be noted that entropy decoder 202 does not decode a QM signal for the rectangular block from the stream.

It is to be noted that, as explained with reference to FIG. 50, each of the processing in Step S201 and the processing in Step S202 may be performed on the blocks collectively at the time of starting processing of a sequence, a picture, or a slice, or performed each time when part of the processing is performed in processing of a unit that is a block. In addition, the QMs which are generated by entropy decoder 202 in Step S201 and Step S202 may be a plurality of kinds of QMs for blocks having the same block size which are generated under conditions such as whether each QM is for a luminance block or for a chrominance block, each QM is for an intra-prediction block or for an inter-prediction block, and under other conditions.

Next, a block-based loop is started. First, in Step S203, one of intra predictor 216 and inter predictor 218 performs, for each block, prediction processing using a corresponding one of intra prediction and inter prediction. In Step S204, inverse quantizer 204 performs inverse quantization on quantized transform coefficients (that are quantized coefficients) decoded from a stream using the QM for the square block and the QM for the rectangular block which are outputs in Step S201 and Step S202. It is to be noted that, in intra prediction and inter prediction, a mode for referring to a block in a picture to which a current block to be processed belongs may be used together with a mode for referring to a block in a picture different from a picture to which the current block belongs. At this time, the QM for inter prediction may be used commonly for both the modes, or the QM for intra prediction may be used in the mode for referring to the block in the picture to which the current block belongs. Next, in Step S205, inverse transformer 206 performs inverse transform on the inverse-quantized transform coefficients to generate a residual (prediction error) image. Next, in Step S206, adder 208 adds the residual image and a prediction image to generate a reconstructed image. This sequential processing flow is repeated, and block-based loops end.

In this way, also in the encoding scheme for pictures including rectangular blocks which have various shapes, decoding is possible when only QMs corresponding to square blocks have been described in the stream in the encoding scheme even if QMs corresponding to the rectangular blocks having various shapes have not been described in the stream. In other words, decoder 200 according to Aspect 2 of the present disclosure does not describe the QMs for the rectangular blocks in the stream, which enables reduction in amount of codes of the header area. Furthermore, decoder 200 according to Aspect 2 of the present disclosure is capable of generating the QMs corresponding to the rectangular blocks based on the QMs corresponding to the square blocks, which makes it possible to use QMs also for the rectangular blocks without increasing the amount of codes of the header area. Thus, decoder 200 according to Aspect 2 of the present disclosure is capable of efficiently quantizing the rectangular blocks having various shapes, which increases the possibility of being able to increase the coding efficiency. It is to be noted that the QMs for the square blocks do not always need to be described in the stream, and default QMs for square blocks which have been pre-defined in a standard may be used.

This processing flow is one example, and thus it is to be noted that the processing order described may be changed, part of the processing may be removed, and processing which is not described may be added.

A First Example of a Method of Generating a QM for a Rectangular Block in Aspect 2

FIG. 51 is a diagram for explaining a first example of generating a QM for a rectangular block based on a QM for a square block in Step S102 in FIG. 49 and in Step S202 in FIG. 50. It is to be noted that the processing described here is common between encoder 100 and decoder 200.

FIG. 51 indicates, for each of square blocks each having a size in a range from 2×2 to 256×256, the size of a QM for the square block and the size of a QM for a rectangular block which is generated based on the QM for the square block in association with each other. The example illustrated in FIG. 51 is characterized in that the length of a long side of each rectangular block is the same as the length of one side of the corresponding square block. In other words, this example is characterized in that the size of a current rectangular block to be processed is smaller than the size of the corresponding square block. In other words, encoder 100 and decoder 200 according to Aspect 1 of the present disclosure generates the QM for the rectangular block by down-converting the QM for the square block having the one side whose length is the same as the length of the long side of the current rectangular block to be processed.

It is to be noted that FIG. 51 indicates the correlation relationships between the QMs for the square blocks which have various block sizes and the QMs for the rectangular blocks which are generated based on the QMs for the square blocks without discriminating luminance blocks and chrominance blocks. The correlation relationship between a QM for a square block and a QM for a rectangular block adapted to a format to be actually used may be derived appropriately. For example, in the case of a 4:2:0 format, a luminance block has a size that is twice the size of a chrominance block. Thus, when referring to the luminance block in the processing of generating a QM for a rectangular block based on a QM for a square block, an available QM for the square block corresponds to a square block having a size in a range from 4×4 to 256×256. At this time, only a QM corresponding to a rectangular block having a size defined by a short-side length of 4 or more and a long-side length of 256 or less is used as the QM for the rectangular block that is generated based on the QM for the square block. Thus, when referring to the chrominance block in the processing of generating a QM for a rectangular block based on a QM for a square block, an available QM for the square block corresponds to a square block having a size in a range from 2×2 to 128×128. At this time, only a QM corresponding to a rectangular block having a size defined by a short-side length of 2 or more and a long-side length of 128 or less is used as the QM for the rectangular block that is generated based on the QM for the square block.

In addition, in the case of a 4:4:4 format for example, a luminance block has the same size as the size of a chrominance block. Thus, when referring to the chrominance block in the processing of generating a QM for a rectangular block as in the case of referring to the luminance block, an available QM for a square block corresponds to a square block having a size in a range from 4×4 to 256×256.

In this way, the correlation relationship between the QM for the square block and the QM for the rectangular block may be appropriately derived according to the format to be actually used.

It is to be noted that the block sizes indicated in FIG. 51 are examples, and thus block sizes are not limited to the sizes therein. For example, QMs which have block sizes other than the block sizes indicated as examples in FIG. 51 may be used, and only QMs for square blocks each having one of the block sizes indicated in FIG. 51 may be used.

FIG. 52 is a diagram for illustrating a method of generating a QM for a rectangular block explained with reference to FIG. 51 by down-converting a corresponding QM for a square block.

In the example of FIG. 52, a QM for an 8×4 rectangular block is generated based on a QM for an 8×8 square block.

In the down-conversion processing: matrix elements in a QM for a square block may be split into groups whose number may be the same as the number of matrix elements in a QM for a rectangular block; for each of the groups, matrix elements included in the group may be arranged sequentially in either the horizontal direction or the vertical direction of the square block; for each of the groups, the matrix element located at the lowest-frequency side among the matrix elements in the group may be determined to correspond to one of the matrix elements in the QM for the rectangular block.

For example, in FIG. 52, the matrix elements in the QM for the 8×8 square block are enclosed by bold lines for each predetermined number of matrix elements. Each of the predetermined number of matrix elements enclosed by the bold lines makes up a corresponding one of the groups. In the down-conversion processing illustrated as an example in FIG. 52, the QM for the 8×8 square block is split in such a manner that the number of the groups is the same as the number of the matrix elements (also referred to as quantized coefficients) in the QM for the rectangular block to be generated based on the QM for the 8×8 square block. In the example in FIG. 52, each pair of quantized coefficients neighboring vertically makes up one of the groups. Next, in the QM for the 8×8 square block, the quantized coefficient located at the lowest-frequency side (corresponding to the upper side in the example in FIG. 52) in each of the groups is selected, and determined to be one of the values in the QM for the 8×4 rectangular block.

It is to be noted that the method of selecting one quantized coefficient in each group as a value in the QM for the rectangular block is not limited to the above example, and another method may be used. For example, it is also excellent that, instead of the quantized coefficient located at the lowest-frequency side in each group, the quantized coefficient located at the highest-frequency side may be handled as one of the values in the QM for the rectangular block, or the quantized coefficient located at a middle-frequency side may be handled as one of the values in the QM for the rectangular block. Alternatively, it is also excellent to use any of the average value, the smallest value, the largest value, the median value, or the like of all or a part the quantized coefficients in the group, etc. When a decimal value is obtained as a result of calculation of any of these values, it is to be noted that the decimal value may be rounded into an integer value using rounding-up, rounding-down, rounding-off, or the like.

It is to be noted that methods of selecting one quantized coefficient from each of the groups in a QM for a square block may be switched according to a frequency domain in which the group is located in the QM for the square block. For example, the quantized coefficient located at the lowest-frequency side in each of the groups located at a low-frequency side may be selected from among the quantized coefficients in each group; the quantized coefficient located at the highest-frequency side in each of the groups located at a high-frequency side may be selected from among the quantized coefficients in each group; and the quantized coefficient located at the middle side in each of the groups located at an intermediate-frequency side may be selected from among the quantized coefficients in each group.

It is to be noted that, for example, the lowest-frequency component (corresponding to the upper-left quantized coefficient in the example in FIG. 52) in a QM for a rectangular block to be generated may be described in a stream and may be directly set from the stream, instead of deriving a QM for a square block. In that case, the amount of information to be described in the stream increases, and thus the amount of codes of the header area inevitably increases. However, it is possible to directly control the quantized coefficient of the lowest-frequency component which affects a resulting image quality most significantly in the QM, which increases the possibility of being able to increase the image quality.

Although the example in the case of generating the QM for the rectangular block by vertically down-converting the QM for the square block has been described here, it is to be noted that a QM for a rectangular block may also be generated by horizontally down-converting a QM for a square block using a method similar to the method in the example in FIG. 52.

A Second Example of a Method of Generating a QM for a Rectangular Block in Aspect 2

FIG. 53 is a diagram for explaining a second example of generating a QM for a rectangular block based on a QM for a square block in Step S102 in FIG. 49 and in Step S202 in FIG. 50. It is to be noted that the processing described here is common between encoder 100 and decoder 200.

FIG. 53 indicates, for each of square blocks each having a size in a range from 2×2 to 256×256, the size of a QM for the square block and the size of a QM for a rectangular block generated based on the QM for the square block in association with each other. The example illustrated in FIG. 53 is characterized in that the length of a short side of each rectangular block is the same as the length of one side of the corresponding square block. In other words, this example is characterized in that the size of the current rectangular block to be processed is larger than the size of the corresponding square block. In other words, encoder 100 and decoder 200 according to Aspect 1 of the present disclosure generates the QM for the rectangular block by up-converting the QM for the square block having the one side whose length is the same as the length of the short side of the current rectangular block to be processed.

It is to be noted that FIG. 53 indicates the correlation relationship between the QMs for the square blocks which have various block sizes and the QMs for the rectangular blocks which are generated based on the QMs for the square blocks without discriminating luminance blocks and chrominance blocks. The correlation relationship between a QM for a square block and a QM for a rectangular block adapted to a format to be actually used may be derived appropriately. For example, in the case of a 4:2:0 format, when referring to a luminance block in the processing of generating a QM for a rectangular block based on a QM for a square block, only a QM corresponding to a rectangular block having a size defined by a short-side length of 4 or more and a long-side length of 256 or less is used as the QM for the rectangular block that is generated based on the QM for the square block. In addition, when referring to a chrominance block in the processing of generating a QM for a rectangular block based on a QM for a square block, only a QM corresponding to a rectangular block having a size defined by a short-side length of 2 or more and a long-side length of 128 or less is used as the QM for the rectangular block that is generated based on the QM for the square block. It is to be noted that the same details explained with reference to FIG. 51 apply to the case of a 4:4:4 format, and thus the same explanation is not repeated here.

In this way, the correlation relationship between the QM for the square block and the QM for the rectangular block may be appropriately derived according to the format to be actually used.

It is to be noted that the block sizes indicated in FIG. 53 are examples, and thus block sizes are not limited to the sizes therein. For example, QMs which have block sizes other than the block sizes indicated as examples in FIG. 53 may be used, and only QMs for square blocks each having one of the block sizes indicated in FIG. 53 may be used.

FIG. 54 is a diagram for illustrating a method of generating each QM for a rectangular block explained with reference to FIG. 53 by up-converting a corresponding QM for a square block.

In the example of FIG. 54, the QM for the 8×4 rectangular block based on the QM for the 4×4 square block.

In the up-conversion processing: (i) matrix elements in a QM for a rectangular block may be split into groups whose number may be the same as the number of matrix elements in a QM for a square block; and for each of the groups, matrix elements, corresponding to the group, in the QM for the rectangular block may be determined in such a manner that matrix elements included in the group are duplicated; or (ii) for each of the groups, matrix elements, corresponding to the group, in the QM for the rectangular block may be determined by performing linear interpolation between neighboring matrix elements among the matrix elements in the QM for the rectangular block.

For example, in FIG. 54, the matrix elements in the QM for the 8×4 rectangular block are enclosed by bold lines for each predetermined number of matrix elements. Each of the predetermined number of matrix elements enclosed by the bold lines makes up a corresponding one of the groups. In the up-conversion processing illustrated as an example in FIG. 54, the QM for the 8×4 rectangular block is split in such a manner that the number of the groups is the same as the number of the matrix elements (also referred to as quantized coefficients) in the QM for the 4×4 square block. In the example in FIG. 54, each pair of quantized coefficients neighboring horizontally makes up one of the groups. Next, in the QM for the 8×4 rectangular block, values of the QM for the 8×4 rectangular block are determined by selecting the values of quantized coefficients in the QM for the square block corresponding to the group as the quantized coefficients which make up the group, and arranging the selected values in the group.

It is to be noted that the method of deriving quantized coefficients in each group in the QM for the rectangular block is not limited to the example, and another method may be used. For example, quantized coefficients may be derived by performing linear interpolation, or the like, with reference to values of quantized coefficients in a neighboring frequency domain so that the quantized coefficients in the group are sequential values. When a decimal value is obtained as a result of calculation of any of these values, it is to be noted that the decimal value may be rounded into an integer value using rounding-up, rounding-down, rounding-off, or the like.

It is to be noted that methods of deriving quantized coefficients in each of the groups in a QM for a rectangular block may be switched according to a frequency domain in which the group is located in the QM for the rectangular block. For example, quantized coefficients in each of the groups located at the low-frequency side may be derived so that the values of the quantized coefficients are comparatively small values, and quantized coefficients in each of the groups located at the high-frequency side may be derived so that the values of the quantized coefficients are comparatively large values.

It is to be noted that the lowest-frequency component (upper-left quantized coefficients in the example in FIG. 54) in a QM for a rectangular block to be generated may be described in a stream and be directly set from the stream, instead of deriving a QM for a square block. In that case, the amount of information to be described in the stream increases, and thus the amount of codes of the header area inevitably increases. However, it is possible to directly control the quantized coefficient of the lowest-frequency component which affects a resulting image quality most significantly in the QM, which increases the possibility of being able to increase the image quality.

Although the example in the case of generating the QM for the rectangular block by vertically up-converting the QM for the square block has been described here, it is to be noted that a QM for a rectangular block may also be generated by horizontally up-converting a QM for a square block using a method similar to the method in the example in FIG. 54.

[Another Variation of Aspect 2 Relating to Encoding and Decoding]

It is also excellent that a method of switching to one of the first example and the second example may be performed according to the size of a rectangular block to be generated, and the one is used, as the method of generating a QM for the rectangular block based on a QM for a square block. The first example is the method of generating the QM for the rectangular block described with reference to FIG. 51 and FIG. 52, and the second example method is the method of generating the QM for the rectangular block described with reference to FIG. 53 and FIG. 54. For example, there is a method of comparing a size ratio of the vertical-side length and the horizontal-side length of a rectangular block with a threshold value, and using the first example when the comparison result is larger than the threshold value and using the second example when the comparison result is smaller than the threshold value (the size ratio is a magnification in down-conversion or up-conversion). Alternatively, there is a method of describing, in a stream, a flag indicating which one of the schemes of the first example and the second example is used for each size of a rectangular block, and performs switching according to the flag. In this way, since it is possible to switch between down-conversion processing and up-conversion processing according to the size of a rectangular block, it is possible to generate a more appropriate QM for the rectangular block.

It is also excellent that up-conversion processing and down-conversion processing may be used in combination for one rectangular block, instead of switching between up-conversion processing and down-conversion processing for each of the sizes of rectangular blocks. For example, it is also excellent that a QM for a 32×64 rectangular block is generated by horizontally up-converting a QM for a 32×32 square block, and then a QM for a 16×64 rectangular block is generated by horizontally down-converting the QM for the 32×64 rectangular block.

Alternatively, two-dimensional up-conversion processing may be performed on one rectangular block. For example, it is also excellent that a QM for a 32×16 rectangular block is generated by vertically up-converting a QM for a 16×16 square block, and then a QM for a 32×64 rectangular block is generated by horizontally up-converting the QM for the 32×16 rectangular block.

It is to be noted that, two-dimensional down-conversion processing may be performed on one rectangular block. For example, it is also excellent that a QM for a 64×32 rectangular block is generated by horizontally down-converting a QM for a 64×64 square block, and then a QM for a 16×32 rectangular block is generated by vertically down-converting the QM for the 64×32 rectangular block.

[Effects of Aspect 2 Relating to Encoding and Decoding]

With the configuration explained with reference to FIG. 49 and FIG. 50, also in the encoding scheme for pictures including rectangular blocks which have various shapes, encoder 100 and decoder 200 according to Aspect 2 of the present disclosure are capable of encoding and decoding the rectangular blocks by describing, in a stream, only QMs corresponding to square blocks without describing, in the stream, QMs corresponding to the rectangular blocks having various shapes. In other words, encoder 100 and decoder 200 according to Aspect 2 of the present disclosure do not require that the QMs for the rectangular blocks are described in the stream, which enables reduction in amount of codes of the header area. Furthermore, encoder 100 and decoder 200 according to Aspect 2 of the present disclosure are capable of generating the QMs corresponding to the rectangular blocks based on the QMs corresponding to the square blocks, which makes it possible to use appropriate QMs also for the rectangular blocks without increasing the amount of codes of the header area. In addition, decoder 200 according to Aspect 2 of the present disclosure generates quantization matrices corresponding to rectangular blocks based on corresponding square blocks, and thus does not always need to decode any quantization matrices corresponding to rectangular blocks. Thus, encoder 100 according to Aspect 2 of the present disclosure is capable of efficiently quantizing the rectangular blocks having various shapes, which makes it possible to increase the coding efficiency. Furthermore, decoder 200 according to Aspect 2 of the present disclosure is capable of efficiently inverse-quantizing the rectangular blocks, which makes it possible to increase the processing efficiency.

This aspect may be performed in combination with at least part of other aspects. Part of processing indicated in the flow chart relating to this aspect, a part of the configuration of each apparatus, a part of syntax, etc. may be combined with counterparts in other aspects, and a combined aspect may be performed.

Aspect 3

Hereinafter, descriptions are given of encoder 100, decoder 200, an encoding method, and a decoding method according to Aspect 3 of the present disclosure.

[Effects of Aspect 3 Relating to Encoding and Decoding]

FIG. 55 is a flow chart indicating one example of a flow of encoding using a quantization matrix (QM) in encoder 100 according to Aspect 3. It is to be noted that encoder 100 described here performs encoding for each square or rectangular block obtained by splitting a frame.

First, in Step S301, quantizer 108 generates, for each of square blocks or rectangular blocks which have various block sizes, a QM corresponding to the size of a domain including effective transform coefficients (hereinafter also referred to as an effective transform coefficient domain) in the block. In other words, quantizer 108 performs quantization using a quantization matrix only for a plurality of transform coefficients in a predetermined domain at a low-frequency domain side among the plurality of transform coefficients included in a current block to be processed.

Entropy encoder 110 describes, in a stream, a signal relating to a QM corresponding to the effective transform coefficient domain generated in Step S301. In other words, entropy encoder 110 encodes, in the bitstream, the signal relating to the quantization matrix corresponding only to the transform coefficients in the predetermined range at the low-frequency domain side. It is to be noted that quantizer 108 may generate the QM corresponding to the effective transform coefficient domain based on values which have been defined by a user and pre-set in encoder 100, or may adaptively generate the QM corresponding to the effective transform coefficient domain using encoded information of an already encoded picture. In addition, the QM corresponding to the effective transform coefficient domain may be encoded in an area in the stream. The area is one of a sequence header area, a picture header area, a slice header area, a supplemental information area, or another area storing another parameter. The QM corresponding to the effective transform coefficient domain does not always need to be described in the stream. At this time, quantizer 108 may use default values which have been pre-defined in a standard as the values of the QM corresponding to the effective transform coefficient domain.

It is to be noted that, as explained with reference to FIG. 55, the processing in Step S301 may be performed on the blocks collectively at the time of starting processing of a sequence, a picture, or a slice, or performed each time when part of the processing is performed in processing of a unit that is a block. In addition, the QM generated in Step S301 may comprise a plurality of kinds of QMs for blocks having the same size which are generated under conditions such as whether each QM is for a luminance block or for a chrominance block, each QM is for an intra-prediction block or for an inter-prediction block, and under other conditions.

It is to be noted that, in the processing flow indicated in FIG. 55, the processing other than the processing in Step S301 is in the block-based loop processing, and thus is similar to the processing in Aspect 2 explained with reference to FIG. 49.

In this way, it is possible to encode the current block to be processed having a block size, for which only the partial domain at the low-frequency side among the transform coefficients included in the current block is defined as a domain including effective transform coefficients, without wastefully describing, in the stream, a signal relating to a QM corresponding to a domain including the remaining ineffective transform coefficients. Accordingly, it is possible to reduce the amount of codes of the header area, which increases the possibility of being able to increase the coding efficiency.

It is to be noted that this processing flow is one example, and thus it is to be noted that the processing order described may be changed, part of the processing may be removed, and processing which is not described may be added.

FIG. 56 is a flow chart indicating one example of a flow of decoding using a quantization matrix (QM) in decoder 200 according to Aspect 3. It is to be noted that decoder 200 described here performs decoding for each square or rectangular block obtained by splitting a frame.

First, in Step S401, entropy decoder 202 decodes a signal relating to a QM corresponding to an effective transform coefficient domain from a stream, and generates the QM corresponding to the effective transform coefficient domain using the signal relating to the QM corresponding to the decoded effective transform coefficient domain. The QM corresponding to the effective transform coefficient domain in each of current blocks having various block sizes is a QM corresponding to the size of the effective transform coefficient domain in the current block. It is to be noted that, the QM corresponding to the effective transform coefficient domain may be decoded from an area in the stream. The area is one of a sequence header area, a picture header area, a slice header area, a supplemental information area, or another area storing another parameter. At this time, for example, default values which have been pre-defined in a standard may be used as values of the QM corresponding to the effective transform coefficient domain.

It is to be noted that the processing in Step S401 may be performed on the blocks collectively at the time of starting processing of a sequence, a picture, or a slice, as explained with reference to FIG. 56, or performed each time when part of the processing is performed in processing of a unit that is a block. In addition, the QM generated by entropy decoder 202 in Step S401 may comprise a plurality of kinds of QMs for blocks having the same block size which are generated under conditions such as whether each QM is for a luminance block or for a chrominance block, each QM is for an intra-prediction block or for an inter-prediction block, and under other conditions.

It is to be noted that, in the processing flow indicated in FIG. 56, the processing other than the processing in Step S401 is in the block-based loop processing, and thus is similar to the processing in Aspect 2 explained with reference to FIG. 50.

In this way, it is possible to decode the current block to be processed having a block size, for which only the partial domain at the low-frequency side among the transform coefficients included in the current block is defined as a domain including effective transform coefficients, without wastefully describing, in the stream, a signal relating to a QM corresponding to a domain including remaining ineffective transform coefficients. Accordingly, it is possible to reduce the amount of codes of the header area, which increases the possibility of being able to increase the coding efficiency.

It is to be noted that this processing flow is one example, and thus it is to be noted that the processing order described may be changed, part of the processing may be removed, and processing which is not described may be added.

FIG. 57 is a diagram for explaining an example of a QM corresponding to the size of an effective transform coefficient domain in each of blocks which have various block sizes in Step S301 in FIG. 55 and in Step S401 in FIG. 56. It is to be noted that the processing described here is common between encoder 100 and decoder 200.

In FIG. 57, (a) illustrates an example in the case where a current block is a square block having a block size of 64×64. Only the 32×32 domain at a low-frequency side indicated by the diagonal lines in the diagram is the effective transform coefficient domain. In the current block, transform coefficients in the domain other than the effective transform coefficient domain are forcedly set to 0. In other words, since the transform coefficients are made ineffective, quantization processing and inverse quantization processing are unnecessary. In other words, encoder 100 and decoder 200 according to Aspect 3 of the present disclosure generates only the 32×32 QM corresponding to the 32×32 domain at the low-frequency side indicated by the diagonal lines in the diagram.

Next, in FIG. 57, (b) illustrates an example in the case where a current block is a rectangular block having a block size of 64×32. As in the example of (a) in FIG. 57, in the example of (b) in FIG. 57, encoder 100 and decoder 200 generate only a 32×32 QM corresponding to the 32×32 domain at the low-frequency side.

Next, in FIG. 57, (c) illustrates an example in the case where a current block is a rectangular block having a block size of 64×16. Unlike the example of (a) in FIG. 57, in the example of (c) in FIG. 57, the vertical block size is only 16, and thus encoder 100 and decoder 200 generate only a 32×16 QM corresponding to the 32×16 domain at the low-frequency side.

In this way, when one of the vertical sides or the horizontal sides of a current block are longer than 32, the transform coefficients in the domain outside the domain whose sides are all within 32 are invalidated, and the domain whose sides are all within 32 which is the effective transform coefficient domain are handled as a processing target of quantization and inverse quantization, and the processing target is subjected to generation of quantized coefficients in the QM, and encoding in and decoding from a stream of a signal relating to the QM.

In this way, encoding and decoding are possible without wastefully describing, in the stream, the signal relating to the QM corresponding to the ineffective transform coefficient domain, which makes it possible to reduce the amount of codes of the header area. This increases the possibility of being able to increase the coding efficiency.

It is to be noted that the sizes of the effective transform coefficient domains explained with reference to FIG. 57 are examples, and thus effective transform coefficient domains having sizes other than the example sizes may be used. For example, a domain having at most 32×32 size may be handled as an effective transform coefficient domain when a current block is a luminance block, and a domain having at most 16×16 size may be handled as an effective transform coefficient domain when a current block is a chrominance block. Alternatively, a domain having at most 32×32 size may be handled as an effective transform coefficient domain when a current block has long sides each having a length of 64, and a domain having at most 62×62 size may be handled as an effective transform coefficient domain when a current block has long sides each having a length of 128 or 256.

It is to be noted that the QM corresponding to only the effective transform coefficient domain explained with reference to FIG. 57 may be generated after coefficients of a quantization matrix corresponding to all frequency components in a square block or a rectangular block are once generated by performing similar processing according to the method explained in Aspect 3. In this case, the amount of a signal relating to the QM to be described in a stream does not change from the amount of a signal in the case where the method explained in Aspect 3 is performed. Furthermore, it is possible to skip quantization processing on the domain other than the effective transform coefficient domain while maintaining the advantage of being able to generate all the QMs for the square or rectangular blocks directly using the method explained in Aspect 3. This increases the possibility of being able to reduce the amount of processing relating to quantization processing.

[Effects of the Variation of Aspect 3 Relating to Encoding and Decoding]

FIG. 58 is a flow chart indicating one example of a flow of encoding using a quantization matrix (QM) in encoder 100 according to a variation of Aspect 3. It is to be noted that encoder 100 described here performs encoding for each square or rectangular block obtained by splitting a frame.

This variation is obtained by combining the configuration in Aspect 3 explained with reference to FIG. 55 and the configuration in Aspect 2 explained with reference to FIG. 49. In this variation, processing in Step S501 and processing in Step S502 are performed instead of processing in Step S301.

First, in Step S501, quantizer 108 generates a QM for a square block. At this time, the QM for the square block is a QM corresponding to the size of the effective transform coefficient domain in the square block. Entropy encoder 110 described, in the stream, the QM signal for a square block generated in Step S501. At this time, the signal relating to the QM described in the stream is a signal relating only to quantized coefficients corresponding to the effective transform coefficient domain.

Next, in Step S502, quantizer 108 generates a QM for a rectangular block using the QM for the square block generated in Step S501. It is to be noted that entropy encoder 110 does not describe a signal relating to a QM for a rectangular block in the stream.

It is to be noted that, in the processing flow indicated in FIG. 58, the processing other than the processing in Step S501 and the processing in Step S502 is in the block-based loop processing, and thus is similar to the processing in Aspect 2 explained with reference to FIG. 49.

In this way, also in the encoding scheme for pictures including rectangular blocks which have various shapes, describing only QMs corresponding to square blocks in the stream enables encoding without describing QMs corresponding to the rectangular blocks having various shapes. Furthermore, it is possible to encode the current block to be processed having a block size, for which only the domain including some of the transform coefficients included in the current block is defined as a domain including effective transform coefficients (that is, an effective transform coefficient domain), without wastefully describing, in the stream, a signal relating to a QM of a domain including the remaining ineffective transform coefficients. Accordingly, it is possible to use the QM for the rectangular block while reducing the amount of codes of the header area, which increases the possibility of being able to increase the coding efficiency.

It is to be noted that this processing flow is one example, and thus it is to be noted that the processing order described may be changed, part of the processing may be removed, and processing which is not described may be added.

FIG. 59 is a flow chart indicating one example of a flow of decoding using a quantization matrix (QM) in decoder 200 according to the variation of Aspect 3. It is to be noted that decoder 200 described here performs decoding for each square or rectangular block obtained by splitting a frame.

This variation is obtained by combining the configuration in Aspect 3 explained with reference to FIG. 56 and the configuration in Aspect 2 explained with reference to FIG. 50. In this variation, processing in Step S601 and processing in Step S602 are performed instead of processing in Step S401.

First, in Step S601, entropy decoder 202 decodes the signal relating to the QM for the square block from the stream to generate the QM for the square block using the decoded signal relating to the QM for the square block. At this time, the signal relating to the QM for the square block decoded from the stream is a signal relating only to quantized coefficients corresponding to the effective transform coefficient domain in the QM for the square block. Thus, the QM for the square block generated by entropy decoder 202 is a QM corresponding to the size of the effective transform coefficient domain.

Next, in Step S602, entropy decoder 202 generates a QM for a rectangular block using the QM for the square block generated in Step S601. At this time, entropy decoder 202 does not decode a signal relating to the QM for the rectangular block from the stream.

It is to be noted that, in the processing flow indicated in FIG. 59, the processing other than the processing in Step S601 and the processing in Step S602 is in the block-based loop processing, and thus is similar to the processing in Aspect 2 explained with reference to FIG. 50.

In this way, in the encoding scheme for pictures including rectangular blocks which have various shapes, decoding is possible when only signals relating to QMs corresponding to square blocks have been described in the encoding scheme even if signals relating to QMs corresponding to the rectangular blocks having various shapes have not been described. Furthermore, it is possible to decode the current block to be processed having a block size, for which only the domain including some of the transform coefficients included in the current block is defined as a domain including effective transform coefficients (that is, an effective transform coefficient domain), without wastefully describing, in the stream, a signal relating to a QM of a domain including the remaining ineffective transform coefficients. Accordingly, it is possible to use the QM for the rectangular block while reducing the amount of codes of the header area, which increases the possibility of being able to increase the coding efficiency.

It is to be noted that this processing flow is one example, and thus it is to be noted that the processing order described may be changed, part of the processing may be removed, and processing which is not described may be added.

A First Example of a Method of Generating a QM for a Rectangular Block in the Variation of Aspect 3

FIG. 60 is a diagram for explaining a first example of generating a QM for a rectangular block based on a QM for a square block in Step S502 in FIG. 58 and in Step S602 in FIG. 59. It is to be noted that the processing described here is common between encoder 100 and decoder 200.

FIG. 60 illustrates, for each of square blocks each having a size in a range from 2×2 to 256×256, the size of a QM for a square block and the size of a QM for a rectangular block generated based on the QM for the square block in association with each other. The example in FIG. 60 illustrates, the sizes of current blocks to be processed and the sizes of effective transform coefficient domains in the respective current blocks. The numerical values described in the parenthesis indicate the sizes of the effective transform coefficient domains in the respective current blocks. In the case of a rectangular block in which the size of a current block to be processed and the size of an effective transform coefficient size are the same, the same processing as in Aspect 2 explained with reference to FIG. 49 is performed, and thus it is to be noted that numerical values in the case are omitted in the association table indicated in FIG. 60.

Here, it is characterized in that the length of a long side of each of rectangular blocks is the same as the length of one side of a corresponding rectangular block, and the rectangular block is smaller than the square block. In other words, the QM for the rectangular block is generated by down-converting the QM for the square block.

It is to be noted that FIG. 60 indicates the correlation relationship between the QMs for the square blocks which have various block sizes and the QMs for the rectangular blocks which are generated based on the QMs for the square blocks without discriminating luminance blocks and chrominance blocks. The correlation relationship between a QM for a square block and a QM for a rectangular block adapted to a format to be actually used may be derived appropriately. For example, in the case of a 4:2:0 format, a luminance block has a size that is twice the size of a chrominance block. Thus, when referring to the luminance block in the processing of generating the QM for the rectangular block based on the QM for the square block, an available QM for the square block corresponds to a square block having a size in a range from 4×4 to 256×256. At this time, only a QM corresponding to a rectangular block having a size defined by a short-side length of 4 or more and a long-side length of 256 or less is used as the QM for the rectangular block that is generated based on the QM for the square block. In addition, when referring to a chrominance block in the processing of generating the QM for the rectangular block based on the QM for the square block, only a QM corresponding to a rectangular block having a size defined by a short-side length of 2 or more and a long-side length of 128 or less is used as the QM for the rectangular block that is generated based on the QM for the square block. It is to be noted that the same details explained with reference to FIG. 51 apply to the case of a 4:4:4 format, and thus the same explanation is not repeated here.

In this way, the correlation relationship between the QM for the square block and the QM for the rectangular block may be appropriately derived according to the format to be actually used.

The sizes of the effective transform coefficient domains described in FIG. 60 are examples, and thus the sizes of effective transform coefficient domains other than the sizes indicated as examples in FIG. 60 may be used.

It is to be noted that the block sizes indicated in FIG. 60 are examples, and thus block sizes are not limited to the sizes therein. For example, block sizes other than the block sizes indicated as examples in FIG. 60 may be used, and only some of the block sizes indicated as examples in FIG. 60 may be used.

FIG. 61 is a diagram for illustrating a method of generating the QM for the rectangular block explained with reference to FIG. 60 by down-converting the corresponding QM for the square block.

In the example in FIG. 61, a QM corresponding to a 32×32 effective transform coefficient domain in a 64×32 rectangular block is generated based on a QM corresponding to a 32×32 effective transform coefficient domain in a 64×64 square block.

First, as illustrated in (a) in FIG. 61, a QM for an intermediate 64×64 square block having a 32×64 effective transform coefficient domain is generated by vertically extending a domain with a slop of quantized coefficients in the QM corresponding to the 32×32 effective transform coefficient domain. Examples of extending such a domain with a slope includes: a method of extending a domain with a slope of quantized coefficients so that the difference value between each of the quantized coefficients on the 31st line and a corresponding one of the quantized coefficients on the 32nd line is the difference value between following neighboring quantized coefficients; and a method of extending a domain with a slope of quantized coefficients by deriving a variation amount between (i) the difference value between each of the quantized coefficients on the 30th line and a corresponding one of the quantized coefficients on the 32st line and (ii) the difference value between each of the quantized coefficients on the 31st line and a corresponding one of the quantized coefficients on the 32nd line is the difference value between following neighboring quantized coefficients, and correcting, by the variation amount, the difference value between following neighboring quantized coefficients. As illustrated in (b) in FIG. 61, a QM for a 64×32 rectangular block is generated by down-converting the QM for the intermediate 64×64 square block having the 32×64 effective transform coefficient domain, using a method similar to the method explained with reference to FIG. 52. At this time, the resulting effective transform coefficient domain is a 32×32 domain with diagonal lines in the QM for the 64×32 rectangular block illustrated in (c) in FIG. 61.

Although the example in the case of generating the QM for the rectangular block by vertically down-converting the QM for the square block has been described here, it is to be noted that a QM for a rectangular block may also be generated by horizontally down-converting a QM for a square block using a method similar to the method in the example in FIG. 61.

Here, explanation has been given of generating the QM for the rectangular block in two-stage steps via the QM for the intermediate square block. However, it is to be noted that a QM for a rectangular block may be directly generated based on a QM for a square block having an effective transform coefficient domain by using a conversion expression, or the like that derives a processing result similar to the result in the example in FIG. 61, without the intermediate QM for the square block.

A Second Example of a Method of Generating a QM for a Rectangular Block in the Variation of Aspect 3

FIG. 62 is a diagram for explaining a second example of generating a QM for a rectangular block based on a QM for a square block in Step S502 in FIG. 58 and in Step S602 in FIG. 59. It is to be noted that the processing described here is common between encoder 100 and decoder 200.

FIG. 62 illustrates, for each of square blocks each having a size in a range from 2×2 to 256×256, the size of a QM for a square block and the size of a QM for a rectangular block generated based on the QM for the square block in association with each other. The example in FIG. 62 illustrates, the sizes of current blocks to be processed and the sizes of effective transform coefficient domains in the respective current blocks. The numerical values described in the parenthesis indicate the sizes of the effective transform coefficient domains in the respective current blocks. In the case of a rectangular block in which the size of a current block and the size of the effective transform coefficient size are the same, the same processing as in Aspect 2 explained with reference to FIG. 53 is performed, and thus it is to be noted that numerical values in the case are omitted in the association table indicated in FIG. 62.

Here, it is characterized in that the length of a short side of each of rectangular blocks is the same as the length of one side of a corresponding square block, and the rectangular block is larger than the square block. In other words, the QM for the rectangular block is generated by up-converting the QM for the square block.

It is to be noted that FIG. 62 indicates the correlation relationship between the QMs for the square blocks which have various block sizes and the QMs for the rectangular blocks which are generated based on the QMs for the square blocks without discriminating luminance blocks and chrominance blocks. The correlation relationship between a QM for a square block and a QM for a rectangular block adapted to a format to be actually used may be derived appropriately. For example, in the case of a 4:2:0 format, a chrominance block has a size that is twice the size of a luminance block. Thus, in the case of 4:2:0 format, when referring to a luminance block in the processing of generating the QM for the rectangular block based on the QM for the square block, only a QM corresponding to a rectangular block having a size defined by a short-side length of 4 or more and a long-side length of 256 or less is used as the QM for the rectangular block that is generated based on the QM for the square block. In addition, when referring to a chrominance block in the processing of generating the QM for the rectangular block based on the QM for the square block, only a QM corresponding to a rectangular block having a size defined by a short-side length of 2 or more and a long-side length of 128 or less is used as the QM for the rectangular block that is generated based on the QM for the square block. It is to be noted that the same details explained with reference to FIG. 61 apply to the case of a 4:4:4 format, and thus the same explanation is not repeated here.

In this way, the correlation relationship between the QM for the square block and the QM for the rectangular block may be appropriately derived according to the format to be actually used.

The sizes of the effective transform coefficient domains described in FIG. 62 are examples, and thus the sizes of effective transform coefficient domains other than the sizes indicated as examples in FIG. 62 may be used.

It is to be noted that the block sizes indicated in FIG. 62 are examples, and thus block sizes are not limited to the sizes therein. For example, block sizes other than the block sizes indicated as examples in FIG. 62 may be used, and only some of the block sizes indicated in FIG. 62 may be used.

FIG. 63 is a diagram for illustrating a method of generating the QM for the rectangular block explained with reference to FIG. 62 by up-converting the corresponding QM for a square block.

In the example in FIG. 63, a QM corresponding to a 32×32 effective transform coefficient domain in a 64×32 rectangular block is generated based on a QM corresponding to a 32×32 effective transform coefficient domain in a 32×32 square block.

First, as illustrated in (a) in FIG. 63, a QM for an intermediate 64×32 rectangular block is generated by up-converting the QM for the 32×32 square block using a method similar to the method explained with reference to FIG. 54. At this time, the effective transform coefficient domain is also up-converted to a 64×32 effective transform coefficient domain.

Next, as illustrated in (b) in FIG. 63, a QM for a 64×32 rectangular block having a 32×32 effective transform coefficient block is generated by extracting only the 32×32 domain at the low-frequency side from the 64×32 effective transform coefficient domain.

Although the example in the case of generating the QM for the rectangular block by horizontally up-converting the QM for the square block has been described here, it is to be noted that a QM for a rectangular block may also be generated by vertically up-converting a QM for a square block using a method similar to the method in the example in FIG. 60.

Here, explanation is given of generating the QM for the rectangular block in two-stage steps via the QM for the intermediate rectangular block. However, it is to be noted that a QM for a rectangular block may be directly generated based on a QM for a square block by using a conversion expression, or the like that derives a processing result similar to the result in the example in FIG. 62, without the QM for an intermediate rectangular block.

[A Variation of Aspect 3 relating to Encoding and Decoding]

It is also excellent that switching to one of the first example method and the second example method may be performed according to the size of a rectangular block to be generated, and the one is used, as the method of generating a QM for a rectangular block based on a QM for a square block. The first example method is the method of generating the QM for the rectangular block described with reference to FIG. 60 and FIG. 61, and the second example method is the method of generating the QM for the rectangular block described with reference to FIG. 62 and FIG. 63. For example, there is a method of comparing a size ratio of the vertical-side length and the horizontal-side length of a rectangular block with a threshold value, and using the first example when the comparison result is larger than the threshold value and using the second example when the comparison result is smaller than the threshold value (the size ratio is a magnification in down-conversion or up-conversion). Alternatively, there is a method of describing, in a stream, a flag indicating which one of the schemes of the first example and the second example is used for each size of a rectangular block, and performs switching according to the flag. In this way, since it is possible to switch between down-conversion processing and up-conversion processing according to the size of the rectangular block, it is possible to generate a more appropriate QM for the rectangular block.

[Effects of Aspect 3 Relating to Encoding and Decoding and the Variation of Aspect 3]

With the configuration explained with reference to FIG. 55 and FIG. 56, encoder 100 and decoder 200 according to Aspect 3 of the present disclosure are capable of encoding and decoding a current rectangular block to be processed having a block size, for which only the domain including some of the transform coefficients included in the current block is defined as an effective transform coefficient domain, without describing, in the stream, a signal relating to a QM of a domain including the remaining ineffective transform coefficients. Accordingly, it is possible to reduce the amount of codes of the header area, which increases the possibility of being able to increase the coding efficiency.

Furthermore, with the configuration explained with reference to FIG. 58 and FIG. 59, also in the encoding scheme for pictures including the rectangular blocks which have various shapes, encoder 100 and decoder 200 according to Aspect 3 of the present disclosure are capable of encoding and decoding rectangular blocks by describing, in a stream, only QMs corresponding to square blocks without describing, in the stream, QMs corresponding to the rectangular blocks having the various shapes. In other words, encoder 100 and decoder 200 according to the variation of Aspect 3 of the present disclosure are capable of generating the QMs corresponding to the rectangular blocks based on the QMs corresponding to the square blocks, which makes it possible to use appropriate QMs also for the rectangular blocks without increasing the amount of codes of the header area. Thus, encoder 100 and decoder 200 according to Aspect 3 of the present disclosure are capable of efficiently quantizing the rectangular blocks having the various shapes, which increases the possibility of being able to increase the coding efficiency.

This aspect may be performed in combination with at least part of other aspects. Part of processing indicated in the flow chart relating to this aspect, a part of the configuration of each apparatus, a part of syntax, etc. may be combined with counterparts in other aspects, and a combined aspect may be performed.

Aspect 4

Hereinafter, descriptions are given of encoder 100, decoder 200, an encoding method, and a decoding method according to Aspect 4 of the present disclosure.

[Encoding and Decoding according to Aspect 4]

FIG. 64 is a flow chart indicating one example of a flow of encoding using a quantization matrix (QM) in encoder 100 according to Aspect 4. It is to be noted that encoder 100 described here performs encoding for each square or rectangular block obtained by splitting a frame.

First, in Step S701, quantizer 108 generates a QM corresponding to diagonal components in a current block to be processed (hereinafter, the QM is also referred to as a QM having only diagonal components), and generates a QM corresponding to a current block to be processed, based on values of quantized coefficients of the QM having only the diagonal components in each of the square block and rectangular blocks having various shapes, by using a common method to be described below. In other words, quantizer 108 generates the quantization matrix for the current block, based on the diagonal components in the QM. The quantization matrix for the current block is for transform coefficients arranged sequentially in the diagonal direction in the current block among the plurality of transform coefficients in the current block. It is to be noted that using the common method means using the common method for all current blocks to be processed regardless of the shapes and sizes of the blocks. In addition, the diagonal components means a plurality of coefficients on the diagonal line that extends from the low-frequency side to the high-frequency side in each current block.

Entropy encoder 110 describes, in a stream, a signal relating to a QM having only diagonal components generated in Step S701. In other words, entropy encoder 110 encodes a signal relating to the diagonal components of the quantization matrix into a bitstream.

It is to be noted that quantizer 108 may generate values of quantized coefficients in the QM having only the diagonal components, based on values which have been defined by a user and pre-set to encoder 100, or may adaptively generate the QM having only the diagonal components using encoded information of a picture which has been already encoded. In addition, the QM having only the diagonal components may be encoded in an area in the stream. The area is one of a sequence header area, a picture header area, a slice header area, a supplemental information area, or another area storing another parameter. It is to be noted that the QM having only the diagonal components does not always need to be described in a stream. At this time, quantizer 108 may use default values which have been pre-defined in a standard as values of the QM having only the diagonal components.

It is to be noted, as explained with reference to FIG. 64, that the processing in Step S701 may be performed on the blocks collectively at the time of starting processing of a sequence, a picture, or a slice, or performed each time when part of the processing is performed in processing of a unit that is a block. In addition, the QM generated in Step S701 may comprise a plurality of kinds of QMs for blocks having the same block size which are generated under conditions such as whether each QM is for a luminance block or for a chrominance block, each QM is for an intra-prediction block or for an inter-prediction block, and under other conditions.

It is to be noted that, in the processing flow indicated in FIG. 64, the processing other than the processing in Step S701 is in the block-based loop processing, and thus is similar to the processing in Aspect 2 explained with reference to FIG. 49.

In this way, it is possible to encode each of the current blocks which have various block sizes by describing, in the stream, only the quantized coefficients of the diagonal components in the QM without describing, in the stream, all the quantized coefficients in the QM of the current block. Accordingly, it is possible to generate and use the QM corresponding to each current block without significantly increasing the amount of codes of the header area also in the encoding scheme using blocks having many shapes which include rectangular blocks. This increases the possibility of being able to increase the coding efficiency.

It is to be noted that this processing flow is one example, and thus it is to be noted that the processing order described may be changed, part of the processing may be removed, and processing which is not described may be added.

FIG. 65 is a flow chart indicating one example of a flow of decoding using a quantization matrix (QM) in decoder 200 according to Aspect 4. It is to be noted that decoder 200 described here performs decoding for each square or rectangular block obtained by splitting a frame.

First, in Step S801, entropy decoder 202 decodes a signal relating to a QM having only diagonal components from a stream, and generates a QM for one of current blocks having various shapes such as square blocks and rectangular blocks suitably for the size of each block using a signal relating to the QM having only the diagonal components which have been decoded, according to a common method to be described below. It is to be noted that the QM having only the diagonal components may be decoded from an area in the stream. The area is one of a sequence header area, a picture header area, a slice header area, a supplemental information area, or another area storing another parameter. It is to be noted that the QM having only the diagonal components does not always need to be described in a stream. At this time, for example, default values which have been pre-defined in a standard may be used as values of only the diagonal components in the QM.

It is to be noted, as explained with reference to FIG. 65, that the processing in Step S801 may be performed on the blocks collectively at the time of starting processing of a sequence, a picture, or a slice, or performed each time when part of the processing is performed in processing of a unit that is a block. In addition, the QM generated by entropy decoder 202 in Step S801 may comprise a plurality of kinds of QMs for each of blocks having the same block size which are generated under conditions such as whether each QM is for a luminance block or for a chrominance block, each QM is for an intra-prediction block or for an inter-prediction block, and under other conditions.

It is to be noted that, in the processing flow indicated in FIG. 65, the processing other than the processing in Step S801 is in the block-based loop processing, and thus is similar to the processing in Aspect 2 explained with reference to FIG. 50.

In this way, it is possible to perform decoding when only the quantized coefficients of the diagonal components in the QM for the current block included in the current blocks which have various block sizes have been described in the stream even if not all the quantized coefficients in the QM have been described in the stream. Accordingly, it is possible to reduce the amount of codes of the header area, which increases the possibility of being able to increase the coding efficiency.

It is to be noted that this processing flow is one example, and thus it is to be noted that the processing order described may be changed, part of the processing may be removed, and processing which is not described may be added.

FIG. 66 is a diagram for explaining one example of generating, in each of Step S701 in FIG. 64 and in Step S801 in FIG. 65, a QM for a current block to be processed having one of various block sizes, based on values of quantized coefficients of a QM having only diagonal components in the current blocks using a common method to be described below. It is to be noted that the processing described here is common between encoder 100 and decoder 200.

Encoder 100 and decoder 200 according to Aspect 4 of the present disclosure generate a quantization matrix (QM) for a current block by duplicating each of the plurality of matrix elements of the diagonal components in the current block in the horizontal direction and the vertical direction. More specifically, encoder 100 and decoder 200 generate the QM for the current block by directly extending the values of quantized coefficients in the QM having the diagonal components both in the upper direction and the lower direction, in other words, arranging the same values sequentially.

Although the method of generating the QM for the current block in the case where the current block is a square block has been described here, it is to be noted that a QM for a current block may be generated based on the values of quantized coefficients of a QM having diagonal components, similarly to the example in FIG. 66 also in the case where the current block is a rectangular block.

FIG. 67 is a diagram for explaining another example of generating, in each of Step S701 in FIG. 64 and in Step S801 in FIG. 65, QMs for a current block to be processed having one of various block sizes, based on values of quantized coefficients of a QM having only diagonal components in the current block using a common method to be described below. It is to be noted that the processing described here is common between encoder 100 and decoder 200.

Encoder 100 and decoder 200 according to Aspect 4 of the present disclosure may generate a quantization matrix for a current block by duplicating each of the plurality of matrix elements of the diagonal components of the current block in a diagonal direction. More specifically, encoder 100 and decoder 200 generate the QM for the current block by directly extending the values of quantized coefficients in the QM having the diagonal components both in the lower left direction and the upper right direction, in other words, arranging the same values sequentially.

At this time, encoder 100 and decoder 200 may generate the QM for the current block by duplicating each of quantized coefficients in the diagonal direction using also quantized coefficients of components neighboring the diagonal components in addition to the quantized coefficients of the diagonal components. In other words, the quantization matrix (QM) for the current block may be generated based on the plurality of matrix elements of the diagonal components and the matrix elements located neighboring the diagonal components. In this way, even in the case where it is difficult to pad all the quantized coefficients in the current block using only the diagonal components, it is possible to pad all the quantized coefficients using the quantized coefficients of the components neighboring the diagonal components. It is to be noted that the components neighboring the diagonal components are, for example, components each of which neighbors any one of the plurality of coefficients on the diagonal line that extends from the low-frequency side to the high-frequency side in the current block.

For example, the quantized coefficients of the components neighboring the diagonal components are quantized coefficients at the locations illustrated in FIG. 67. Encoder 100 and decoder 200 may encode, decode, and set, in the stream, a signal relating to the quantized coefficients of the components neighboring the diagonal components, or may derive and set quantized coefficients by performing, for example, interpolation based on values of neighboring quantized coefficients among the quantized coefficients of the diagonal components, without encoding and decoding such a signal in and from the stream.

Although the method of generating the QM for the current block in the case where the current block is the square block has been described here, it is to be noted that a QM for a current block may be generated based on the values of quantized coefficients of a QM having diagonal components, similarly to the example in FIG. 67 also in the case where a current block is a rectangular block.

[Another Variation of Aspect 4 relating to Encoding and Decoding]

Although the method of generating the quantized coefficients of the entire QM of the current block based on the quantized coefficients of the QM having the diagonal components has been described in each of the examples in FIG. 66 and FIG. 67, it is also excellent that only the quantized coefficients of a part of the QM in the current block may be generated based on the quantized coefficients of the QM having the diagonal components. For example, it is also excellent that all the quantized coefficients included in a QM corresponding to a low-frequency side domain in a current block is encoded in and decoded from a stream, and only the quantized coefficients of a QM corresponding to an intermediate-frequency side domain and a high-frequency side domain in the current block may be generated based on the quantized coefficients of the QM having the diagonal components in the current block.

It is to be noted that a method of generating a QM for a rectangular block based on a QM for a square block may be obtained by combining the method according to Aspect 4 explained with reference to FIG. 64 and FIG. 65 and the method according to Aspect 2 explained with reference to FIG. 49 and FIG. 50. For example, it is also excellent that the QM for the square block is generated based on the values of quantized coefficients of the QM having only the diagonal components in the square block by performing one of the above-described two common methods as explained in Aspect 4, and the QM for the rectangular block may be generated using the QM for the square block generated as explained in Aspect 2.

It is to be noted that a method of generating a QM for a rectangular block based on a QM for a square block may be obtained by combining the method according to Aspect 4 explained with reference to FIG. 64 and FIG. 65 and the method according to Aspect 3 explained with reference to FIG. 55 and FIG. 56. For example, the QM corresponding to the size of the effective transform coefficient domain in each of the blocks which have various block sizes may be generated based on the values of the quantized coefficients of the QM having only diagonal components in the effective transform coefficient domain by performing one of the above-described common methods.

[Effects of Aspect 4 Relating to Encoding and Decoding]

With the configuration explained with reference to FIG. 64 and FIG. 65, encoder 100 and decoder 200 according to Aspect 4 of the present disclosure are capable of encoding and decoding each of the current blocks which have various block sizes by describing, in a stream, only the quantized coefficients of the QM having the diagonal components of the current block even if not all the quantized coefficients of the QM of the current block have been described in the stream. Accordingly, it is possible to reduce the amount of codes of the header area, which increases the possibility of being able to increase the coding efficiency.

This aspect may be performed by combining at least part of the other aspects in the present disclosure. In addition, this aspect may be performed by combining, with other aspects, part of the processes indicated in any of the flow charts according to the aspect, part of the configuration of any of the devices, part of syntaxes, etc.

Other Examples

Encoder 100 and decoder 200 in each of the above-described examples may be used as an image encoder and an image decoder, respectively, or may be used as a video encoder and a video decoder, respectively.

Alternatively, each of encoder 100 and decoder 200 may be used as a prediction device. In other words, each of encoder 100 and decoder 200 may correspond to only inter predictor 126 and inter predictor 218. The other constituent elements may be included in other devices.

In addition, at least a part of each of the examples described above may be used as an encoding method or a decoding method, may be used as a prediction method, or may be used as another method.

In addition, each constituent element may be circuitry as described above. Circuits may compose circuitry as a whole, or may be separate circuits. Alternatively, each constituent element may be implemented as a general processor, or may be implemented as an exclusive processor.

In addition, the process that is executed by a particular constituent element may be executed by another constituent element. In addition, the processing execution order may be modified, or a plurality of processes may be executed in parallel. In addition, an encoder and decoder may include encoder 100 and decoder 200.

In addition, each constituent element may be configured with dedicated hardware, or may be implemented by executing a software program suitable for the constituent element. Each constituent element may be implemented by a program executer such as a CPU or a processor reading and executing a software program recorded on a recording medium such as a hard disc or a semiconductor memory.

More specifically, each of encoder 100 and decoder 200 may include processing circuitry and storage which is electrically coupled to the processing circuitry and is accessible from the processing circuitry. For example, the processing circuitry corresponds to processor a1 or b1, and the storage corresponds to memory a2 or b2.

The processing circuitry includes at least one of the dedicated hardware and the program executer, and executes processing using the storage. In addition, the storage stores a software program which is executed by the program executer when the processing circuitry includes the program executer.

Here, the software which implements either encoder 100, decoder 200, or the like described above is a program indicated below.

For example, the program may cause a computer to execute an encoding method including; performing quantization on a plurality of transform coefficients of a current block to be encoded, using a quantization matrix when orthogonal transform is performed on the current block and secondary transform is not performed on the current block; and performing quantization on the plurality of transform coefficients of the current block without using the quantization matrix when orthogonal transform is not performed on the current block and when both orthogonal transform and secondary transform are performed on the current block.

For example, the program may cause a computer to execute a decoding method including: performing inverse quantization on a plurality of transform coefficients of a current block to be decoded, using a quantization matrix when inverse orthogonal transform is performed on the current block and inverse secondary transform is not performed on the current block; and performing inverse quantization on the plurality of transform coefficients of the current block without using the quantization matrix when inverse orthogonal transform is not performed on the current block and when both inverse orthogonal transform and inverse secondary transform are performed on the current block.

Although aspects of encoder 100 and decoder 200 have been described based on the representative examples, aspects of encoder 100 and decoder 200 are not limited to the representative examples. The scope of the aspects of encoder 100 and decoder 200 may encompass embodiments obtainable by adding, to any of these examples, various kinds of modifications that a person skilled in the art would arrive at without deviating from the scope of the present disclosure and embodiments configurable by arbitrarily combining constituent elements in different examples.

One or more of the aspects disclosed herein may be performed by combining at least part of the other aspects in the present disclosure. In addition, one or more of the aspects disclosed herein may be performed by combining, with other aspects, part of the processes indicated in any of the flow charts according to the aspects, part of the configuration of any of the devices, part of syntaxes, etc.

[Implementations and Applications]

As described in each of the above embodiments, each functional or operational block may typically be realized as an MPU (micro processing unit) and memory, for example. Moreover, processes performed by each of the functional blocks may be realized as a program execution unit, such as a processor which reads and executes software (a program) recorded on a recording medium such as ROM. The software may be distributed. The software may be recorded on a variety of recording media such as semiconductor memory. Note that each functional block can also be realized as hardware (dedicated circuit). Various combinations of hardware and software may be employed.

The processing described in each of the embodiments may be realized via integrated processing using a single apparatus (system), and, alternatively, may be realized via decentralized processing using a plurality of apparatuses. Moreover, the processor that executes the above-described program may be a single processor or a plurality of processors. In other words, integrated processing may be performed, and, alternatively, decentralized processing may be performed.

Embodiments of the present disclosure are not limited to the above exemplary embodiments; various modifications may be made to the exemplary embodiments, the results of which are also included within the scope of the embodiments of the present disclosure.

Next, application examples of the moving picture encoding method (image encoding method) and the moving picture decoding method (image decoding method) described in each of the above embodiments will be described, as well as various systems that implement the application examples. Such a system may be characterized as including an image encoder that employs the image encoding method, an image decoder that employs the image decoding method, or an image encoder-decoder that includes both the image encoder and the image decoder. Other configurations of such a system may be modified on a case-by-case basis.

Usage Examples

FIG. 68 illustrates an overall configuration of content providing system ex100 suitable for implementing a content distribution service. The area in which the communication service is provided is divided into cells of desired sizes, and base stations ex106, ex107, ex108, ex109, and ex110, which are fixed wireless stations in the illustrated example, are located in respective cells.

In content providing system ex100, devices including computer ex111, gaming device ex112, camera ex113, home appliance ex114, and smartphone ex115 are connected to internet ex101 via internet service provider ex102 or communications network ex104 and base stations ex106 through ex110. Content providing system ex100 may combine and connect any combination of the above devices. In various implementations, the devices may be directly or indirectly connected together via a telephone network or near field communication, rather than via base stations ex106 through ex110. Further, streaming server ex103 may be connected to devices including computer ex111, gaming device ex112, camera ex113, home appliance ex114, and smartphone ex115 via, for example, internet ex101. Streaming server ex103 may also be connected to, for example, a terminal in a hotspot in airplane ex117 via satellite ex116.

Note that instead of base stations ex106 through ex110, wireless access points or hotspots may be used. Streaming server ex103 may be connected to communications network ex104 directly instead of via internet ex101 or internet service provider ex102, and may be connected to airplane ex117 directly instead of via satellite ex116.

Camera ex113 is a device capable of capturing still images and video, such as a digital camera. Smartphone ex115 is a smartphone device, cellular phone, or personal handy-phone system (PHS) phone that can operate under the mobile communications system standards of the 2G, 3G, 3.9G, and 4G systems, as well as the next-generation 5G system.

Home appliance ex114 is, for example, a refrigerator or a device included in a home fuel cell cogeneration system.

In content providing system ex100, a terminal including an image and/or video capturing function is capable of, for example, live streaming by connecting to streaming server ex103 via, for example, base station ex106. When live streaming, a terminal (e.g., computer ex111, gaming device ex112, camera ex113, home appliance ex114, smartphone ex115, or a terminal in airplane ex117) may perform the encoding processing described in the above embodiments on still-image or video content captured by a user via the terminal, may multiplex video data obtained via the encoding and audio data obtained by encoding audio corresponding to the video, and may transmit the obtained data to streaming server ex103. In other words, the terminal functions as the image encoder according to one aspect of the present disclosure.

Streaming server ex103 streams transmitted content data to clients that request the stream. Client examples include computer ex111, gaming device ex112, camera ex113, home appliance ex114, smartphone ex115, and terminals inside airplane ex117, which are capable of decoding the above-described encoded data. Devices that receive the streamed data may decode and reproduce the received data. In other words, the devices may each function as the image decoder, according to one aspect of the present disclosure.

[Decentralized Processing]

Streaming server ex103 may be realized as a plurality of servers or computers between which tasks such as the processing, recording, and streaming of data are divided. For example, streaming server ex103 may be realized as a content delivery network (CDN) that streams content via a network connecting multiple edge servers located throughout the world. In a CDN, an edge server physically near the client may be dynamically assigned to the client. Content is cached and streamed to the edge server to reduce load times. In the event of, for example, some type of error or change in connectivity due, for example, to a spike in traffic, it is possible to stream data stably at high speeds, since it is possible to avoid affected parts of the network by, for example, dividing the processing between a plurality of edge servers, or switching the streaming duties to a different edge server and continuing streaming.

Decentralization is not limited to just the division of processing for streaming; the encoding of the captured data may be divided between and performed by the terminals, on the server side, or both. In one example, in typical encoding, the processing is performed in two loops. The first loop is for detecting how complicated the image is on a frame-by-frame or scene-by-scene basis, or detecting the encoding load. The second loop is for processing that maintains image quality and improves encoding efficiency. For example, it is possible to reduce the processing load of the terminals and improve the quality and encoding efficiency of the content by having the terminals perform the first loop of the encoding and having the server side that received the content perform the second loop of the encoding. In such a case, upon receipt of a decoding request, it is possible for the encoded data resulting from the first loop performed by one terminal to be received and reproduced on another terminal in approximately real time. This makes it possible to realize smooth, real-time streaming.

In another example, camera ex113 or the like extracts a feature amount (an amount of features or characteristics) from an image, compresses data related to the feature amount as metadata, and transmits the compressed metadata to a server. For example, the server determines the significance of an object based on the feature amount and changes the quantization accuracy accordingly to perform compression suitable for the meaning (or content significance) of the image. Feature amount data is particularly effective in improving the precision and efficiency of motion vector prediction during the second compression pass performed by the server. Moreover, encoding that has a relatively low processing load, such as variable length coding (VLC), may be handled by the terminal, and encoding that has a relatively high processing load, such as context-adaptive binary arithmetic coding (CABAC), may be handled by the server.

In yet another example, there are instances in which a plurality of videos of approximately the same scene are captured by a plurality of terminals in, for example, a stadium, shopping mall, or factory. In such a case, for example, the encoding may be decentralized by dividing processing tasks between the plurality of terminals that captured the videos and, if necessary, other terminals that did not capture the videos, and the server, on a per-unit basis. The units may be, for example, groups of pictures (GOP), pictures, or tiles resulting from dividing a picture. This makes it possible to reduce load times and achieve streaming that is closer to real time.

Since the videos are of approximately the same scene, management and/or instructions may be carried out by the server so that the videos captured by the terminals can be cross-referenced. Moreover, the server may receive encoded data from the terminals, change the reference relationship between items of data, or correct or replace pictures themselves, and then perform the encoding. This makes it possible to generate a stream with increased quality and efficiency for the individual items of data.

Furthermore, the server may stream video data after performing transcoding to convert the encoding format of the video data. For example, the server may convert the encoding format from MPEG to VP (e.g., VP9), may convert 11.264 to 11.265, etc.

In this way, encoding can be performed by a terminal or one or more servers. Accordingly, although the device that performs the encoding is referred to as a “server” or “terminal” in the following description, some or all of the processes performed by the server may be performed by the terminal, and likewise some or all of the processes performed by the terminal may be performed by the server. This also applies to decoding processes.

[3D, Multi-Angle]

There has been an increase in usage of images or videos combined from images or videos of different scenes concurrently captured, or of the same scene captured from different angles, by a plurality of terminals such as camera ex113 and/or smartphone ex115. Videos captured by the terminals may be combined based on, for example, the separately obtained relative positional relationship between the terminals, or regions in a video having matching feature points.

In addition to the encoding of two-dimensional moving pictures, the server may encode a still image based on scene analysis of a moving picture, either automatically or at a point in time specified by the user, and transmit the encoded still image to a reception terminal. Furthermore, when the server can obtain the relative positional relationship between the video capturing terminals, in addition to two-dimensional moving pictures, the server can generate three-dimensional geometry of a scene based on video of the same scene captured from different angles. The server may separately encode three-dimensional data generated from, for example, a point cloud and, based on a result of recognizing or tracking a person or object using three-dimensional data, may select or reconstruct and generate a video to be transmitted to a reception terminal, from videos captured by a plurality of terminals.

This allows the user to enjoy a scene by freely selecting videos corresponding to the video capturing terminals, and allows the user to enjoy the content obtained by extracting a video at a selected viewpoint from three-dimensional data reconstructed from a plurality of images or videos. Furthermore, as with video, sound may be recorded from relatively different angles, and the server may multiplex audio from a specific angle or space with the corresponding video, and transmit the multiplexed video and audio.

In recent years, content that is a composite of the real world and a virtual world, such as virtual reality (VR) and augmented reality (AR) content, has also become popular. In the case of VR images, the server may create images from the viewpoints of both the left and right eyes, and perform encoding that tolerates reference between the two viewpoint images, such as multi-view coding (MVC), and, alternatively, may encode the images as separate streams without referencing. When the images are decoded as separate streams, the streams may be synchronized when reproduced, so as to recreate a virtual three-dimensional space in accordance with the viewpoint of the user.

In the case of AR images, the server may superimpose virtual object information existing in a virtual space onto camera information representing a real-world space, based on a three-dimensional position or movement from the perspective of the user. The decoder may obtain or store virtual object information and three-dimensional data, generate two-dimensional images based on movement from the perspective of the user, and then generate superimposed data by seamlessly connecting the images. Alternatively, the decoder may transmit, to the server, motion from the perspective of the user in addition to a request for virtual object information. The server may generate superimposed data based on three-dimensional data stored in the server in accordance with the received motion, and encode and stream the generated superimposed data to the decoder. Note that superimposed data typically includes, in addition to RGB values, an a value indicating transparency, and the server sets the a value for sections other than the object generated from three-dimensional data to, for example, 0, and may perform the encoding while those sections are transparent. Alternatively, the server may set the background to a determined RGB value, such as a chroma key, and generate data in which areas other than the object are set as the background. The determined RGB value may be predetermined.

Decoding of similarly streamed data may be performed by the client (e.g., the terminals), on the server side, or divided therebetween. In one example, one terminal may transmit a reception request to a server, the requested content may be received and decoded by another terminal, and a decoded signal may be transmitted to a device having a display. It is possible to reproduce high image quality data by decentralizing processing and appropriately selecting content regardless of the processing ability of the communications terminal itself. In yet another example, while a TV, for example, is receiving image data that is large in size, a region of a picture, such as a tile obtained by dividing the picture, may be decoded and displayed on a personal terminal or terminals of a viewer or viewers of the TV. This makes it possible for the viewers to share a big-picture view as well as for each viewer to check his or her assigned area, or inspect a region in further detail up close.

In situations in which a plurality of wireless connections are possible over near, mid, and far distances, indoors or outdoors, it may be possible to seamlessly receive content using a streaming system standard such as MPEG Dynamic Adaptive Streaming over HTTP (MPEG DASH). The user may switch between data in real time while freely selecting a decoder or display apparatus including the user's terminal, displays arranged indoors or outdoors, etc. Moreover, using, for example, information on the position of the user, decoding can be performed while switching which terminal handles decoding and which terminal handles the displaying of content. This makes it possible to map and display information, while the user is on the move in route to a destination, on the wall of a nearby building in which a device capable of displaying content is embedded, or on part of the ground. Moreover, it is also possible to switch the bit rate of the received data based on the accessibility to the encoded data on a network, such as when encoded data is cached on a server quickly accessible from the reception terminal, or when encoded data is copied to an edge server in a content delivery service.

[Scalable Encoding]

The switching of content will be described with reference to a scalable stream, illustrated in FIG. 69, which is compression coded via implementation of the moving picture encoding method described in the above embodiments. The server may have a configuration in which content is switched while making use of the temporal and/or spatial scalability of a stream, which is achieved by division into and encoding of layers, as illustrated in FIG. 69. Note that there may be a plurality of individual streams that are of the same content but different quality. In other words, by determining which layer to decode based on internal factors, such as the processing ability on the decoder side, and external factors, such as communication bandwidth, the decoder side can freely switch between low resolution content and high resolution content while decoding. For example, in a case in which the user wants to continue watching, for example at home on a device such as a TV connected to the internet, a video that the user had been previously watching on smartphone ex115 while on the move, the device can simply decode the same stream up to a different layer, which reduces the server side load.

Furthermore, in addition to the configuration described above, in which scalability is achieved as a result of the pictures being encoded per layer, with the enhancement layer being above the base layer, the enhancement layer may include metadata based on, for example, statistical information on the image. The decoder side may generate high image quality content by performing super-resolution imaging on a picture in the base layer based on the metadata. Super-resolution imaging may improve the Signal-to-Noise (SN) ratio while maintaining resolution and/or increasing resolution. Metadata includes information for identifying a linear or a non-linear filter coefficient, as used in super-resolution processing, or information identifying a parameter value in filter processing, machine learning, or a least squares method used in super-resolution processing.

Alternatively, a configuration may be provided in which a picture is divided into, for example, tiles in accordance with, for example, the meaning of an object in the image. On the decoder side, only a partial region is decoded by selecting a tile to decode. Further, by storing an attribute of the object (person, car, ball, etc.) and a position of the object in the video (coordinates in identical images) as metadata, the decoder side can identify the position of a desired object based on the metadata and determine which tile or tiles include that object. For example, as illustrated in FIG. 70, metadata may be stored using a data storage structure different from pixel data, such as an SEI (supplemental enhancement information) message in HEVC. This metadata indicates, for example, the position, size, or color of the main object.

Metadata may be stored in units of a plurality of pictures, such as stream, sequence, or random access units. The decoder side can obtain, for example, the time at which a specific person appears in the video, and by fitting the time information with picture unit information, can identify a picture in which the object is present, and can determine the position of the object in the picture.

[Web Page Optimization]

FIG. 71 illustrates an example of a display screen of a web page on computer ex111, for example. FIG. 72 illustrates an example of a display screen of a web page on smartphone ex115, for example. As illustrated in FIG. 71 and FIG. 72, a web page may include a plurality of image links that are links to image content, and the appearance of the web page may differ depending on the device used to view the web page. When a plurality of image links are viewable on the screen, until the user explicitly selects an image link, or until the image link is in the approximate center of the screen or the entire image link fits in the screen, the display apparatus (decoder) may display, as the image links, still images included in the content or I pictures; may display video such as an animated gif using a plurality of still images or I pictures; or may receive only the base layer, and decode and display the video.

When an image link is selected by the user, the display apparatus performs decoding while, for example, giving the highest priority to the base layer. Note that if there is information in the Hyper Text Markup Language (HTML) code of the web page indicating that the content is scalable, the display apparatus may decode up to the enhancement layer. Further, in order to guarantee real-time reproduction, before a selection is made or when the bandwidth is severely limited, the display apparatus can reduce delay between the point in time at which the leading picture is decoded and the point in time at which the decoded picture is displayed (that is, the delay between the start of the decoding of the content to the displaying of the content) by decoding and displaying only forward reference pictures (I picture, P picture, forward reference B picture). Still further, the display apparatus may purposely ignore the reference relationship between pictures, and coarsely decode all B and P pictures as forward reference pictures, and then perform normal decoding as the number of pictures received over time increases.

[Autonomous Driving]

When transmitting and receiving still image or video data such as two- or three-dimensional map information for autonomous driving or assisted driving of an automobile, the reception terminal may receive, in addition to image data belonging to one or more layers, information on, for example, the weather or road construction as metadata, and associate the metadata with the image data upon decoding. Note that metadata may be assigned per layer and, alternatively, may simply be multiplexed with the image data.

In such a case, since the automobile, drone, airplane, etc., containing the reception terminal is mobile, the reception terminal may seamlessly receive and perform decoding while switching between base stations among base stations ex106 through ex110 by transmitting information indicating the position of the reception terminal. Moreover, in accordance with the selection made by the user, the situation of the user, and/or the bandwidth of the connection, the reception terminal may dynamically select to what extent the metadata is received, or to what extent the map information, for example, is updated.

In content providing system ex100, the client may receive, decode, and reproduce, in real time, encoded information transmitted by the user.

[Streaming of Individual Content]

In content providing system ex100, in addition to high image quality, long content distributed by a video distribution entity, unicast or multicast streaming of low image quality, and short content from an individual are also possible. Such content from individuals is likely to further increase in popularity. The server may first perform editing processing on the content before the encoding processing, in order to refine the individual content. This may be achieved using the following configuration, for example.

In real time while capturing video or image content, or after the content has been captured and accumulated, the server performs recognition processing based on the raw data or encoded data, such as capture error processing, scene search processing, meaning analysis, and/or object detection processing. Then, based on the result of the recognition processing, the server—either when prompted or automatically—edits the content, examples of which include: correction such as focus and/or motion blur correction; removing low-priority scenes such as scenes that are low in brightness compared to other pictures, or out of focus; object edge adjustment; and color tone adjustment. The server encodes the edited data based on the result of the editing. It is known that excessively long videos tend to receive fewer views. Accordingly, in order to keep the content within a specific length that scales with the length of the original video, the server may, in addition to the low-priority scenes described above, automatically clip out scenes with low movement, based on an image processing result. Alternatively, the server may generate and encode a video digest based on a result of an analysis of the meaning of a scene.

There may be instances in which individual content may include content that infringes a copyright, moral right, portrait rights, etc. Such instance may lead to an unfavorable situation for the creator, such as when content is shared beyond the scope intended by the creator. Accordingly, before encoding, the server may, for example, edit images so as to blur faces of people in the periphery of the screen or blur the inside of a house, for example. Further, the server may be configured to recognize the faces of people other than a registered person in images to be encoded, and when such faces appear in an image, may apply a mosaic filter, for example, to the face of the person. Alternatively, as pre- or post-processing for encoding, the user may specify, for copyright reasons, a region of an image including a person or a region of the background to be processed. The server may process the specified region by, for example, replacing the region with a different image, or blurring the region. If the region includes a person, the person may be tracked in the moving picture, and the person's head region may be replaced with another image as the person moves.

Since there is a demand for real-time viewing of content produced by individuals, which tends to be small in data size, the decoder may first receive the base layer as the highest priority, and perform decoding and reproduction, although this may differ depending on bandwidth. When the content is reproduced two or more times, such as when the decoder receives the enhancement layer during decoding and reproduction of the base layer, and loops the reproduction, the decoder may reproduce a high image quality video including the enhancement layer. If the stream is encoded using such scalable encoding, the video may be low quality when in an unselected state or at the start of the video, but it can offer an experience in which the image quality of the stream progressively increases in an intelligent manner. This is not limited to just scalable encoding; the same experience can be offered by configuring a single stream from a low quality stream reproduced for the first time and a second stream encoded using the first stream as a reference.

Other Implementation and Application Examples

The encoding and decoding may be performed by LSI (large scale integration circuitry) ex500 (see FIG. 68), which is typically included in each terminal. LSI ex500 may be configured of a single chip or a plurality of chips. Software for encoding and decoding moving pictures may be integrated into some type of a recording medium (such as a CD-ROM, a flexible disk, or a hard disk) that is readable by, for example, computer ex111, and the encoding and decoding may be performed using the software. Furthermore, when smartphone ex115 is equipped with a camera, the video data obtained by the camera may be transmitted. In this case, the video data may be coded by LSI ex500 included in smartphone ex115.

Note that LSI ex500 may be configured to download and activate an application. In such a case, the terminal first determines whether it is compatible with the scheme used to encode the content, or whether it is capable of executing a specific service. When the terminal is not compatible with the encoding scheme of the content, or when the terminal is not capable of executing a specific service, the terminal may first download a codec or application software and then obtain and reproduce the content.

Aside from the example of content providing system ex100 that uses internet ex101, at least the moving picture encoder (image encoder) or the moving picture decoder (image decoder) described in the above embodiments may be implemented in a digital broadcasting system. The same encoding processing and decoding processing may be applied to transmit and receive broadcast radio waves superimposed with multiplexed audio and video data using, for example, a satellite, even though this is geared toward multicast, whereas unicast is easier with content providing system ex100.

[Hardware Configuration]

FIG. 73 illustrates further details of smartphone ex115 shown in FIG. 68. FIG. 74 illustrates a configuration example of smartphone ex115. Smartphone ex115 includes antenna ex450 for transmitting and receiving radio waves to and from base station ex110, camera ex465 capable of capturing video and still images, and display ex458 that displays decoded data, such as video captured by camera ex465 and video received by antenna ex450. Smartphone ex115 further includes user interface ex466 such as a touch panel, audio output unit ex457 such as a speaker for outputting speech or other audio, audio input unit ex456 such as a microphone for audio input, memory ex467 capable of storing decoded data such as captured video or still images, recorded audio, received video or still images, and mail, as well as decoded data, and slot ex464 which is an interface for Subscriber Identity Module (SIM) ex468 for authorizing access to a network and various data. Note that external memory may be used instead of memory ex467.

Main controller ex460, which may comprehensively control display ex458 and user interface ex466, power supply circuit ex461, user interface input controller ex462, video signal processor ex455, camera interface ex463, display controller ex459, modulator/demodulator ex452, multiplexer/demultiplexer ex453, audio signal processor ex454, slot ex464, and memory ex467 are connected via bus ex470.

When the user turns on the power button of power supply circuit ex461, smartphone ex115 is powered on into an operable state, and each component is supplied with power from a battery pack.

Smartphone ex115 performs processing for, for example, calling and data transmission, based on control performed by main controller ex460, which includes a CPU, ROM, and RAM. When making calls, an audio signal recorded by audio input unit ex456 is converted into a digital audio signal by audio signal processor ex454, to which spread spectrum processing is applied by modulator/demodulator ex452 and digital-analog conversion, and frequency conversion processing is applied by transmitter/receiver ex451, and the resulting signal is transmitted via antenna ex450. The received data is amplified, frequency converted, and analog-digital converted, inverse spread spectrum processed by modulator/demodulator ex452, converted into an analog audio signal by audio signal processor ex454, and then output from audio output unit ex457. In data transmission mode, text, still-image, or video data may be transmitted under control of main controller ex460 via user interface input controller ex462 based on operation of user interface ex466 of the main body, for example. Similar transmission and reception processing is performed. In data transmission mode, when sending a video, still image, or video and audio, video signal processor ex455 compression encodes, via the moving picture encoding method described in the above embodiments, a video signal stored in memory ex467 or a video signal input from camera ex465, and transmits the encoded video data to multiplexer/demultiplexer ex453. Audio signal processor ex454 encodes an audio signal recorded by audio input unit ex456 while camera ex465 is capturing a video or still image, and transmits the encoded audio data to multiplexer/demultiplexer ex453. Multiplexer/demultiplexer ex453 multiplexes the encoded video data and encoded audio data using a determined scheme, modulates and converts the data using modulator/demodulator (modulator/demodulator circuit) ex452 and transmitter/receiver ex451, and transmits the result via antenna ex450. The determined scheme may be predetermined.

When video appended in an email or a chat, or a video linked from a web page, is received, for example, in order to decode the multiplexed data received via antenna ex450, multiplexer/demultiplexer ex453 demultiplexes the multiplexed data to divide the multiplexed data into a bitstream of video data and a bitstream of audio data, supplies the encoded video data to video signal processor ex455 via synchronous bus ex470, and supplies the encoded audio data to audio signal processor ex454 via synchronous bus ex470. Video signal processor ex455 decodes the video signal using a moving picture decoding method corresponding to the moving picture encoding method described in the above embodiments, and video or a still image included in the linked moving picture file is displayed on display ex458 via display controller ex459. Audio signal processor ex454 decodes the audio signal and outputs audio from audio output unit ex457. Since real-time streaming is becoming increasingly popular, there may be instances in which reproduction of the audio may be socially inappropriate, depending on the user's environment. Accordingly, as an initial value, a configuration in which only video data is reproduced, i.e., the audio signal is not reproduced, may be preferable; audio may be synchronized and reproduced only when an input, such as when the user clicks video data, is received.

Although smartphone ex115 was used in the above example, other implementations are conceivable: a transceiver terminal including both an encoder and a decoder; a transmitter terminal including only an encoder; and a receiver terminal including only a decoder. In the description of the digital broadcasting system, an example is given in which multiplexed data obtained as a result of video data being multiplexed with audio data is received or transmitted. The multiplexed data, however, may be video data multiplexed with data other than audio data, such as text data related to the video. Further, the video data itself rather than multiplexed data may be received or transmitted.

Although main controller ex460 including a CPU is described as controlling the encoding or decoding processes, various terminals often include Graphics Processing Units (GPUs). Accordingly, a configuration is acceptable in which a large area is processed at once by making use of the performance ability of the GPU via memory shared by the CPU and GPU, or memory including an address that is managed so as to allow common usage by the CPU and GPU. This makes it possible to shorten encoding time, maintain the real-time nature of the stream, and reduce delay. In particular, processing relating to motion estimation, deblocking filtering, sample adaptive offset (SAO), and transformation/quantization can be effectively carried out by the GPU instead of the CPU in units of pictures, for example, all at once.

Although only some exemplary embodiments of the present disclosure have been described in detail above, those skilled in the art will readily appreciate that many modifications are possible in the exemplary embodiments without materially departing from the novel teachings and advantages of the present disclosure. Accordingly, all such modifications are intended to be included within the scope of the present disclosure.

INDUSTRIAL APPLICABILITY

The present disclosure is applicable to, for example, television receivers, digital video recorders, car navigation systems, mobile phones, digital cameras, digital video cameras, teleconferencing systems, electronic mirrors, etc. 

What is claimed is:
 1. An encoder, comprising: circuitry; and memory coupled to the circuitry, wherein the circuitry, in operation: determines a transform process to be performed on prediction residuals of a current block, the transform process selectively including an orthogonal transform and selectively including a secondary transform, the orthogonal transform producing transform coefficients of the current block, the secondary transform producing secondary transform coefficients of the current block; and performs either a first quantization process or a second quantization process on the current block based on the determined transform process, wherein the first quantization process is performed on the current block in both of a first case where both the orthogonal transform and the secondary transform are skipped for the current block and a second case where both the orthogonal transform and the secondary transform are performed on the current block, the first quantization process not using a quantization matrix, and the second quantization process is performed on the current block in a case where the orthogonal transform is performed and the secondary transform is not performed on the current block, the second quantization process using a first quantization matrix, the first quantization matrix generated by performing an up-conversion and a down-conversion on a second quantization matrix.
 2. The encoder according to claim 1, wherein the circuitry determines whether to perform the first quantization process or the second quantization process on the current block based on information indicating whether the orthogonal transform and the secondary transform have been performed on the current block.
 3. The encoder according to claim 1, wherein the first quantization matrix has a first number of rows and a first number of columns different from the first number of rows to form a rectangular matrix, the second quantization matrix has a second number of rows and a second number of columns equal to the second number of rows to form a square matrix, in the up-conversion, the circuitry generates the first quantization matrix such that one of the first number of rows or the first number of columns is larger than the second number of rows, and in the down-conversion, the circuitry generates the first quantization matrix such that the other of the first number of rows or the first number of columns is smaller than the second number of rows.
 4. The encoder according to claim 1, wherein the first quantization process quantizes respective prediction residuals and respective secondary transform coefficients using a common quantization parameter.
 5. The encoder according to claim 4, wherein the common quantization parameter is a quantization width.
 6. A decoder, comprising: circuitry; and memory coupled to the circuitry, wherein the circuitry, in operation: determines an inverse transform process to be performed on prediction residuals of a current block, the inverse transform process selectively including an inverse orthogonal transform and selectively including an inverse secondary transform, the inverse orthogonal transform producing transform coefficients of the current block, the inverse secondary transform producing inverse secondary transform coefficients of the current block; and performs either a first inverse quantization process or a second inverse quantization process on the current block based on the determined inverse transform process, wherein the first inverse quantization process is performed on the current block in both of a first case where both the inverse orthogonal transform and the inverse secondary transform are skipped for the current block and a second case where both the inverse orthogonal transform and the inverse secondary transform are performed on the current block, the first inverse quantization process not using an inverse quantization matrix, and the second inverse quantization process is performed on the current block in a case where the inverse orthogonal transform is performed and the inverse secondary transform is not performed on the current block, the second inverse quantization process using a first inverse quantization matrix, the first inverse quantization matrix generated by performing an up-conversion and a down-conversion on a second inverse quantization matrix.
 7. The decoder according to claim 6, wherein the circuitry determines whether to perform the first inverse quantization process or the second inverse quantization process on the current block based on information indicating whether the inverse orthogonal transform and the inverse secondary transform have been performed on the current block.
 8. The decoder according to claim 6, wherein the first inverse quantization matrix has a first number of rows and a first number of columns different from the first number of rows to form a rectangular matrix, the second inverse quantization matrix has a second number of rows and a second number of columns equal to the second number of rows to form a square matrix, in the up-conversion, the circuitry generates the first inverse quantization matrix such that one of the first number of rows or the first number of columns is larger than the second number of rows, and in the down-conversion, the circuitry generates the first inverse quantization matrix such that the other of the first number of rows or the first number of columns is smaller than the second number of rows.
 9. The decoder according to claim 6, wherein the first inverse quantization process inverse-quantizes respective prediction residuals and respective secondary transform coefficients using a common quantization parameter.
 10. The decoder according to claim 9, wherein the common quantization parameter is a quantization width.
 11. An encoding method, comprising: determining a transform process to be performed on prediction residuals of a current block, the transform process selectively including an orthogonal transform and selectively including a secondary transform, the orthogonal transform producing transform coefficients of the current block, the secondary transform producing secondary transform coefficients of the current block; and performing either a first quantization process or a second quantization process on the current block based on the determined transform process, wherein the first quantization process is performed on the current block in both of a first case where both the orthogonal transform and the secondary transform are skipped for the current block and a second case where both the orthogonal transform and the secondary transform are performed on the current block, the first quantization process not using a quantization matrix, and the second quantization process is performed on the current block in a case where the orthogonal transform is performed and the secondary transform is not performed on the current block, the second quantization process using a first quantization matrix, the first quantization matrix generated by performing an up-conversion and a down-conversion on a second quantization matrix.
 12. A decoding method, comprising: determining an inverse transform process to be performed on prediction residuals of a current block, the inverse transform process selectively including an inverse orthogonal transform and selectively including an inverse secondary transform, the inverse orthogonal transform producing transform coefficients of the current block, the inverse secondary transform producing inverse secondary transform coefficients of the current block; and performing either a first inverse quantization process or a second inverse quantization process on the current block based on the determined inverse transform process, wherein the first inverse quantization process is performed on the current block in both of a first case where both the inverse orthogonal transform and the inverse secondary transform are skipped for the current block and a second case where both the inverse orthogonal transform and the inverse secondary transform are performed on the current block, the first inverse quantization process not using a quantization matrix, and the second inverse quantization process is performed on the current block in a case where the inverse orthogonal transform is performed and the inverse secondary transform is not performed on the current block, the second inverse quantization process using a first quantization matrix, the first quantization matrix generated by performing an up-conversion and a down-conversion on a second quantization matrix. 